Search Results - (( java implementation phase algorithm ) OR ( causing problem _ algorithm ))

Refine Results
  1. 1

    Web-based clustering tool using fuzzy k-mean algorithm / Ahmad Zuladzlan Zulkifly by Zulkifly, Ahmad Zuladzlan

    Published 2019
    “…All the algorithm for the engine has been developed by using Java script language. …”
    Get full text
    Get full text
    Thesis
  2. 2

    Optimal route checking using genetic algorithm for UiTM's bus services / Tengku Salman Fathi Tengku Jaafar by Tengku Jaafar, Tengku Salman Fathi

    Published 2006
    “…Although from human logical thinking, the route can be generated easily but the calculation of checking the route whether it is optimal route or not is difficult and will take long time to be implemented. This research study with the development of the Optimal Route Checking Using Genetic Algorithm system should solve this scenario. …”
    Get full text
    Get full text
    Thesis
  3. 3

    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
  4. 4

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

    Published 2006
    “…However, the increase in size of the Gene Ontology has caused problems in maintaining and processing them. …”
    Get full text
    Get full text
    Article
  5. 5

    Tolerable Constructive Graph-Based Hyper-Heuristic Algorithm For Examination Timetabling by Mohammad Pour, Shahrzad

    Published 2009
    “…In heuristic approaches getting stuck in local optimum is one of the propounded problems from early days. The main cause for the local optimal problem is that heuristic algorithms either focus on exploration (global improvement) rather than exploitation (local improvement) or vice versa.…”
    Get full text
    Get full text
    Thesis
  6. 6
  7. 7

    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
  8. 8

    A novel layer by layer energy efficient watchman algorithm for wireless sensor and actor networks by Draz, U., Ali, T., Yasin, S., Hussain, A., Bukhari, S., Nawaz, A., Ali, A., Khan, M.S., Jung, L.T.

    Published 2021
    “…Energy consumption, end-to-end delay, and throughput are considered for the evaluation of the proposed algorithm. At the end, the proposed algorithm is compared with an existing state-of-the-art algorithm like the Efficient Traffic Load Reduction Algorithm (ETLRA) that also works with limbs node for the said problem in the same kind of wireless environment. …”
    Get full text
    Get full text
    Article
  9. 9

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

    Published 2012
    “…An Artificial Intelligence method or technique is selected to provide a solution to this problem. The cause of the shortage in supply-demand is taken to be implemented in the Genetic Algorithms optimization concepts. …”
    Get full text
    Get full text
    Thesis
  10. 10

    Heuristic-Based Ant Colony Optimization Algorithm For Protein Functional Module Detection In Protein Interaction Network by SALLIM, JAMALUDIN

    Published 2017
    “…Ant colony optimization (ACO) is a metaheuristic algorithm that has been successfully applied to several types of optimization problems such as scheduling, routing, and more recently for solving protein functional module detection (PFMD) problem in protein-protein interaction (PPI) networks. …”
    Get full text
    Get full text
    Thesis
  11. 11

    Heuristic-Based Ant Colony Optimization Algorithm For Protein Functional Module Detection In Protein Interaction Network by Sallim, Jamaludin

    Published 2017
    “…Ant colony optimization (ACO) is a metaheuristic algorithm that has been successfully applied to several types of optimization problems such as scheduling, routing, and more recently for solving protein functional module detection (PFMD) problem in protein-protein interaction (PPI) networks. …”
    Get full text
    Get full text
    Thesis
  12. 12
  13. 13

    Leader election algorithm in 2D torus networks with the presence of one link failure by Refai, M., Sharieh, A., Alshammari, F.

    Published 2010
    “…Leader election algorithms solve the instability problem in the network which is caused by leader failure. …”
    Get full text
    Article
  14. 14

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

    Published 2005
    “…Under the constraint of avoiding crosstalk, the research interest is to realize a permutation that will use the minimum number of passes (to route the input request to output without crosstalk). 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
  15. 15

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

    Published 2005
    “…Also an improved simulated annealing is proposed to solve the routing problem. The efficient combination of simulated annealing algorithm with the best heuristic algorithms gave much better result in a very minimal time. …”
    Get full text
    Get full text
    Thesis
  16. 16

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

    Published 2021
    “…Capacitated Multi-source Weber Problem (CMSWP) is a type of Location Allocation Problem (LAP) which have been extensively researched because they can be applied in a variety of contexts. …”
    Get full text
    Get full text
    Thesis
  17. 17

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

    Published 2006
    “…The work presented in this paper is aimed at designing a flexible digital baseband signal processing algorithm (DBSP) for satellite applications. In non-real-time application, there have been many examples or simulations of DBSP, written in C language but the problem is, most of them requires many loops to execute and hence, cause timing problem. …”
    Get full text
    Get full text
    Conference or Workshop Item
  18. 18

    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
  19. 19
  20. 20

    AN INVESTIGATION ON PARTICLE SWARM OPTIMIZATION ALGORITHM FOR DISTRIBUTION SYSTEM PLANNING WITH DISTRIBUTED GENERATION by Shamshiri, Meysam, Gan, Chin Kim, Hasan, I. J., Ab Ghani, Mohd Ruddin

    Published 2012
    “…In this regards, this paper presents the Particle Swarm Optimization (PSO) algorithm to solve the distribution planning problem with DG. …”
    Get full text
    Get full text
    Conference or Workshop Item