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

Search alternatives:

Refine Results
  1. 1
    Attribute reduction based scheduling algorithm with enhanced hybrid genetic algorithm and particle swarm optimization for optimal device selection

    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
    Save to List
    Saved in:
  2. 2
    Ant colony optimization algorithm for load balancing in grid computing

    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
    Save to List
    Saved in:
  3. 3
    Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing

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

    Published 2011
    “…A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against existing grid resource management algorithms such as Antz algorithm, Particle Swarm Optimization algorithm, Space Shared algorithm and Time Shared algorithm, in terms of processing time and resource utilization. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  4. 4
    Resource management in grid computing using ant colony optimization

    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
    Save to List
    Saved in:
  5. 5
    Dynamic Bayesian Networks and Variable Length Genetic Algorithm for Dialogue Act Recognition

    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
    Save to List
    Saved in:
  6. 6
    Dynamic Probability Selection for Flower Pollination Algorithm based on Metropolis-hastings Criteria

    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
    Save to List
    Saved in:
  7. 7
    Dynamic probability selection for flower pollination algorithm based on metropolis-hastings criteria

    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
    Save to List
    Saved in:
  8. 8
    OPTIMIZED MIN-MIN TASK SCHEDULING ALGORITHM FOR SCIENTIFIC WORKFLOWS IN A CLOUD ENVIRONMENT

    OPTIMIZED MIN-MIN TASK SCHEDULING ALGORITHM FOR SCIENTIFIC WORKFLOWS IN A CLOUD ENVIRONMENT by Murad S.S., Badeel R., Alsandi N.S.A., Alshaaya R.F., Ahmed R.A., Muhammed A., Derahman M.

    Published 2023
    “…To achieve this, we propose a new noble mechanism called Optimized Min-Min (OMin-Min) algorithm, inspired by the Min-Min algorithm. …”
    Review
    Save to List
    Saved in:
  9. 9
    Dynamic Bayesian networks and variable length genetic algorithm for designing cue-based model for dialogue act recognition

    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
    Save to List
    Saved in:
  10. 10
    Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization

    Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization by Mohammad Ata, Karimeh Ibrahim

    Published 2019
    “…This study proposes a car parking management system which applies Dijkstra’s algorithm, Ant Colony Optimization (ACO) and Binary Search Tree (BST) in structuring a guidance system for indoor parking. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  11. 11
    Features selection for intrusion detection system using hybridize PSO-SVM

    Features selection for intrusion detection system using hybridize PSO-SVM by Tabaan, Alaa Abdulrahman

    Published 2016
    “…Hybridize Particle Swarm Optimization (PSO) as a searching algorithm and support vector machine (SVM) as a classifier had been implemented to cope with this problem. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  12. 12
    A novel clustering based genetic algorithm for route optimization

    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
    Save to List
    Saved in:
  13. 13
    Enhancement Of Cover Selection – Based Audio Steganography (CAS) Using Block-Based Chaotic Multi – Level Lsb (BCM– LSB) For Balanced Performance

    Enhancement Of Cover Selection – Based Audio Steganography (CAS) Using Block-Based Chaotic Multi – Level Lsb (BCM– LSB) For Balanced Performance by Muhammad Harith bin Noor Azam

    Published 2024
    thesis::doctoral thesis
    Save to List
    Saved in:
  14. 14
    Model structure selection for a discrete-time non-linear system using genetic algorithm

    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
    Save to List
    Saved in:
  15. 15
    Model structure selection for a discrete-time non-linear system using a genetic algorithm

    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
    Save to List
    Saved in:
  16. 16
    Model structure selection for a discrete-time non-linear system using a genetic algorithm

    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
    Save to List
    Saved in:
  17. 17
    Enhanced cell-based algorithm with dynamic radius in solving capacitated multi-source weber problem

    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
    Save to List
    Saved in:
  18. 18
    Implementation of locust inspired scheduling algorithm with huge number of servers for energy efficiency in a cloud datacenter

    Implementation of locust inspired scheduling algorithm with huge number of servers for energy efficiency in a cloud datacenter by Azhar, Nur Huwaina

    Published 2019
    “…Cloudsim is used as Discrete Event Simulation tool and Java as coding language to evaluate LACE algorithm. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  19. 19
    Effects of user selected conditions on modeling of dynamic systems using adaptive fuzzy model

    Effects of user selected conditions on modeling of dynamic systems using adaptive fuzzy model by Yaacob, Mohd. Shafiek, Jamaluddin, Hishamuddin

    Published 2001
    “…In this paper, major properties of an adaptive fuzzy model as a system identifier when trained by the back-propagation algorithm are discussed. The standard rule-based fuzzy models were used to identify discrete-time nonlinear dynamic systems. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  20. 20
    Improved flower pollination optimization algorithm based on swap operator and dynamic switch probability selection

    Improved flower pollination optimization algorithm based on swap operator and dynamic switch probability selection by Iqbal, Muhammad

    Published 2023
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:

Search Tools: