Search Results - (( dynamic selection based algorithm ) OR ( java based optimization algorithm ))

Refine Results
  1. 1

    Attribute reduction based scheduling algorithm with enhanced hybrid genetic algorithm and particle swarm optimization for optimal device selection by Nwogbaga, Nweso Emmanuel, Latip, Rohaya, Affendey, Lilly Suriani, Abdul Rahiman, Amir Rizaan

    Published 2022
    “…Therefore, in this paper, we proposed Dynamic tasks scheduling algorithm based on attribute reduction with an enhanced hybrid Genetic Algorithm and Particle Swarm Optimization for optimal device selection. …”
    Get full text
    Get full text
    Article
  2. 2

    Ant colony optimization algorithm for load balancing in grid computing by Ku-Mahamud, Ku Ruhana, Mohamed Din, Aniza

    Published 2012
    “…This research proposes an enhancement of the ant colony optimization algorithm that caters for dynamic scheduling and load balancing in the grid computing system. …”
    Get full text
    Get full text
    Get full text
    Monograph
  3. 3

    Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing by Husna, Jamal Abdul Nasir

    Published 2011
    “…This research proposes an Enhanced Ant Colony Optimization (EACO) algorithm that caters dynamic scheduling and load balancing in the grid computing system. …”
    Get full text
    Get full text
    Get full text
    Thesis
  4. 4

    Resource management in grid computing using ant colony optimization by Ku-Mahamud, Ku Ruhana, Mohamed Din, Aniza

    Published 2011
    “…Resources with high pheromone value are selected to process the submitted jobs.Global pheromone update is performed after completion processing the jobs in order to reduce the pheromone value of resources.A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against other ant based algorithm, in terms of resource utilization.Experimental results show that EACO produced better grid resource management solution.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Monograph
  5. 5

    Optimization of blood vessel detection in retina images using multithreading and native code for portable devices by Tran, Duc Ngoc, Hussin, Fawnizu Azmadi, Yusoff, Mohd Zuki

    Published 2013
    “…The optimization of a computationally intensive algorithm such as this on a mobile platform is challenging due to the limited resources available. …”
    Get full text
    Get full text
    Conference or Workshop Item
  6. 6

    Automatic Number Plate Recognition on android platform: With some Java code excerpts by ., Abdul Mutholib, Gunawan, Teddy Surya, Kartiwi, Mira

    Published 2016
    “…Hence, the objective of this research is to propose suitable and optimize algorithm for ANPR system on Android mobile phone. …”
    Get full text
    Get full text
    Get full text
    Book
  7. 7

    Evolutionary cost-cognizant regression test case prioritization for object-oriented programs by Bello, AbdulKarim

    Published 2019
    “…Afterward evolutionary algorithm (EA) was employed to prioritize test cases based on the rate severity of fault detection per unit test cost. …”
    Get full text
    Get full text
    Thesis
  8. 8

    Dynamic Bayesian Networks and Variable Length Genetic Algorithm for Dialogue Act Recognition by Ali Yahya, Anwar

    Published 2007
    “…In the initial stage, the dynamic Bayesian networks models are constructed based on a set of lexical cues selected tentatively from the dialogue corpus. …”
    Get full text
    Get full text
    Thesis
  9. 9

    Dynamic Probability Selection for Flower Pollination Algorithm based on Metropolis-hastings Criteria by Zamli, Kamal Zuhairi, Din, Fakhrud, Nasser, Abdullah, Ramli, Nazirah, Mohamed, Noraini

    Published 2021
    “…This paper proposed flower pollination algorithm metropolis-hastings (FPA-MH) based on the adoption of Metropolis-Hastings criteria adopted from the Simulated Annealing (SA) algorithm to enable dynamic selection of the pa probability. …”
    Get full text
    Get full text
    Article
  10. 10

    Dynamic probability selection for flower pollination algorithm based on metropolis-hastings criteria by Zamli, Kamal Zuhairi, Din, Fakhrud, Nasser, Abdullah, Ramli, Nazirah, Mohamed, Noraini

    Published 2021
    “…This paper proposed flower pollination algorithm metropolis-hastings (FPA-MH) based on the adoption of Metropolis-Hastings criteria adopted from the Simulated Annealing (SA) algorithm to enable dynamic selection of the pa probability. …”
    Get full text
    Get full text
    Get full text
    Article
  11. 11

    Input-output based relation combinatorial testing using whale optimization algorithm for generating near optimum number of test suite by Suali, Anjila J., Nuraminah Ramli, Rozmie Razif Othman, Hasneeza Liza Zakaria, Iszaidy Ismail, Nor Shahida Mohd Jamail, Rimuljo Hendradi, Nurol Husna Che Rose

    Published 2025
    “…This study proposes a combinatorial testing method utilizing the Whale Optimization Algorithm (WOA). The study compares the performance of WOA with various existing strategies, such as Greedy, Density, TVG, Union, ParaOrder, ReqOrder, ITTDG, AURA, Java Algorithm (CTJ), TTSGA, and AFA. …”
    Get full text
    Get full text
    Get full text
    Article
  12. 12

    Dynamic Bayesian networks and variable length genetic algorithm for designing cue-based model for dialogue act recognition by Yahya, Anwar Ali, Mahmod, Ramlan, Ramli, Abd Rahman

    Published 2010
    “…In the second stage, the developed variable length genetic algorithm is used to select different sets of lexical cues to constitute the dynamic Bayesian networks' random variables. …”
    Get full text
    Get full text
    Article
  13. 13

    A heuristics approach for classroom scheduling using genetic algorithm technique by Ahmad, Izah R., Sufahani, Suliadi, Ali, Maselan, Mohd Razali, Siti Noor Asyikin

    Published 2017
    “…The proposed of heuristics approach will prompt a superior utilization of the accessible classroom space for a given time table of courses at the university. Genetic Algorithm through Java programming languages were used in this study and aims at reducing the conflicts and optimizes the fitness. …”
    Get full text
    Get full text
    Article
  14. 14

    A novel clustering based genetic algorithm for route optimization by Aibinu, Abiodun Musa, Salau, Habeeb Bello, Najeeb, Athaur Rahman, Nwohu, Mark Ndubuka, Akachukwu, Chichebe

    Published 2016
    “…It was also observed that the introduction of clustering based selection algorithm guaranteed the selection of cluster with the optimal solution in every generation. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  15. 15
  16. 16

    Model structure selection for a discrete-time non-linear system using genetic algorithm by Ahmad, Robiah, Jamaluddin , Hishamuddin, Hussain, Mohd. Azlan

    Published 2004
    “…They offer many advantages such as global search characteristics, and this has led to the idea of using this programming method in modelling dynamic non-linear systems. In this paper, a methodology for model structure selection based on a genetic algorithm was developed and applied to non-linear discrete-time dynamic systems. …”
    Get full text
    Get full text
    Get full text
    Article
  17. 17

    Model structure selection for a discrete-time non-linear system using a genetic algorithm by Ahmad, R., Jamaluddin, H., Hussain, M. A.

    Published 2004
    “…They offer many advantages such as global search characteristics, and this has led to the idea of using this programming method in modelling dynamic non-linear systems. In this paper, a methodology for model structure selection based on a genetic algorithm was developed and applied to non-linear discrete-time dynamic systems. …”
    Get full text
    Get full text
    Article
  18. 18

    Model structure selection for a discrete-time non-linear system using a genetic algorithm by Ahmad, R., Jamaluddin, H., Hussain, M. A.

    Published 2004
    “…They offer many advantages such as global search characteristics, and this has led to the idea of using this programming method in modelling dynamic non-linear systems. In this paper, a methodology for model structure selection based on a genetic algorithm was developed and applied to non-linear discrete-time dynamic systems. …”
    Get full text
    Get full text
    Article
  19. 19

    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. Random selection of facility location in a Cell-based approach may cause infeasible or worse solutions. …”
    Get full text
    Get full text
    Thesis
  20. 20