Search Results - (( using causing problems algorithm ) OR ( java application matching algorithm ))

Refine Results
  1. 1

    Message based random variable length key encryption algorithm. by Mirvaziri, Hamid, Jumari, Kasmiran, Ismail, Mahamod, Mohd Hanapi, Zurina

    Published 2009
    “…Value of random number should be greater than 35 bits and plaintext must be at least 7 bits. A padding algorithm was used for small size messages or big random numbers. …”
    Get full text
    Get full text
    Article
  2. 2
  3. 3
  4. 4
  5. 5

    Securing cloud data system (SCDS) for key exposure using AES algorithm by Thabet Albatol, Mohammed Samer Hasan

    Published 2021
    “…The AES algorithm has its own structure to encrypt and decrypt sensitive data that make the attackers difficult to get the real data when encrypting by AES algorithm. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  6. 6

    Automatic clustering of gene ontology by genetic algorithm by Othman, Razib M., Deris, Safaai, Zakaria, Zalmiyah, Illias, Rosli M., Mohamad, Saberi M.

    Published 2006
    “…Additionally, deciding the number k of clusters to use is not easily perceived and is a hard algorithmic problem. …”
    Get full text
    Get full text
    Article
  7. 7

    A refined differential evolution algorithm for improving the performance of optimization process by A. R., Yusoff, Nafrizuan, Mat Yahya

    Published 2011
    “…Various Artificial Intelligent (AI) algorithms can be applied in solving optimization problems. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  8. 8

    Festive season balancing groceries optimization / Fairuz Mohamed Razi by Mohamed Razi, Fairuz

    Published 2012
    “…This research uses Genetic Algorithms concept and technique to solve an optimization problem in shortage in supply-demand during festive season which is during Hari Raya Aidilfitri. …”
    Get full text
    Get full text
    Thesis
  9. 9

    An improved simulated annealing algorithm to avoid crosstalk in optical omega network by Abdullah, Monir, Othman, Mohamed, Johari, Rozita

    Published 2006
    “…When Simulated Annealing (SA) algorithm was used to solve the problem, it gave good results. …”
    Get full text
    Get full text
    Conference or Workshop Item
  10. 10

    Minimizing makespan of a resource-constrained scheduling problem: a hybrid greedy and genetic algorithms by Mohd Ariffin, Mohd Khairol Anuar, Baharudin, B. T. Hang Tuah, Leman, Zulkiflle, Delgoshaei, Aidin

    Published 2015
    “…Such phenomena may increase makespan of a project and also decline resource-usage efficiency. To solve this problem, many methods have been proposed before. In this article, an effective backward-forward search method (BFSM) is proposed using Greedy algorithm that is employed as a part of a hybrid with a two-stage genetic algorithm (BFSM-GA). …”
    Get full text
    Get full text
    Get full text
    Article
  11. 11

    Enhanced cell-based algorithm with dynamic radius in solving capacitated multi-source weber problem by Nurhazwani, Ahmad Razak

    Published 2021
    “…Second, initial facility configuration was determined using fixed and dynamic radius. Third, Alternating Transportation Problem (ATL) was applied to find a new location. …”
    Get full text
    Get full text
    Thesis
  12. 12

    Three-term backpropagation algorithm for classification problem by Saman, Fadhlina Izzah

    Published 2006
    “…Standard Backpropagation Algorithm (BP) is a widely used algorithm in training Neural Network that is proven to be very successful in many diverse application. …”
    Get full text
    Get full text
    Thesis
  13. 13

    Efficient Sequential and Parallel Routing Algorithms in Optical Multistage Interconnection Network by Abduh Kaid, Monir Abdullah

    Published 2005
    “…This routing problem is an NPhard problem. Many algorithms are designed by many researchers to perform this routing such as window method, sequential algorithm, degree-descending algorithm, simulated annealing algorithm, genetic algorithm and ant colony algorithm.This thesis explores two approaches, sequential and parallel approaches. …”
    Get full text
    Get full text
    Thesis
  14. 14

    An Integrated Principal Component Analysis And Weighted Apriori-T Algorithm For Imbalanced Data Root Cause Analysis by Ong, Phaik Ling

    Published 2016
    “…However, frequent pattern mining (FPM) using Apriori-like algorithms and support-confidence framework suffers from the myth of rare item problem in nature. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  15. 15

    Predicting future sales using genetic algorithm: data mining sales / Siti Hajar Yaacob by Yaacob, Siti Hajar

    Published 2014
    “…This problem can cause the imbalance in sales. Based on the problem statement, Genetic Algorithm was applied to test whether it is compatible to predict the future sales. …”
    Get full text
    Get full text
    Thesis
  16. 16
  17. 17

    Design of a flexible digital baseband signal processing algorithm by Mohamad, Rosalina, Harun, Harlisya, Nuzli, Mohamad Anas, Dimyati, Kaharudin

    Published 2006
    “…In this paper, we show how we solved the problem by satisfying several requirements simultaneously: 1) removing loop or complicated algorithm in DBSP functions with flexible DBSP algorithm 2) using DSP-BIOS Scheduling module to increase performance and make sure our sample data are in packed. …”
    Get full text
    Get full text
    Conference or Workshop Item
  18. 18

    Character classification for license plate recognition system based on image processing using MATLAB by Hashim, Mustafa Adil

    Published 2016
    “…One of the problems is the noise in the captured images, caused by rain and haze, which lead the system to incorrectly recognize the characters. …”
    Get full text
    Get full text
    Thesis
  19. 19

    Zero Algorithms for Avoiding Crosstalk in Optical Multistage Interconnection Network by Ali Al-Shabi, Mohammed Abdulhameed

    Published 2005
    “…This routing problem is an NP-hard problem. Many heuristic algorithms have been proposed and designed to perform the routing such as the sequential algorithm, the sequential down algorithm, the degree-ascending algorithm, the degree-descending algorithm, the Simulated Annealing algorithm and the Ant Colony algorithm. …”
    Get full text
    Get full text
    Thesis
  20. 20