Search Results - (( cover selection problems algorithm ) OR ( java simulation optimization algorithm ))

Refine Results
  1. 1
  2. 2

    Approximate maximum clique algorithm (AMCA): A clever technique for solving the maximum clique problem through near optimal algorithm for minimum vertex cover problem by Fayaz, Muhammad, Arshad,, Shakeel, Shah,, Abdul Salam, Shah, Asadullah

    Published 2018
    “…Background and Objective: The process of solving the Maximum Clique (MC) problem through approximation algorithms is harder, however, the Maximum Vertex Cover (MVC) problem can easily be solved using approximation algorithms. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  3. 3

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

    Published 2011
    “…Global pheromone update is performed after the completion of 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 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
  4. 4

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

    Published 2012
    “…The proposed algorithm is known as the enhance ant colony optimization (EACO). …”
    Get full text
    Get full text
    Get full text
    Monograph
  5. 5

    Optimized Cover Selection for Audio Steganography Using Multi-Objective Evolutionary Algorithm by Noor Azam, Muhammad Harith, Ridzuan, Farida, Mohd Sayuti, M Norazizi Sham

    Published 2023
    “…Existing embedding techniques depend on cover audio selected by users. Unknowingly, users may make a poor cover audio selection that is not optimised in its capacity or imperceptibility features, which could reduce the effectiveness of any embedding technique. …”
    Get full text
    Get full text
    Get full text
    Article
  6. 6

    Fuzzy genetic algorithms for combinatorial optimisation problems by Varnamkhasti, Mohammad Jalali

    Published 2012
    “…The proposed sexual selection and the FGAs are applied to combinatorial optimization problems specifically to those involving selection problems. …”
    Get full text
    Get full text
    Thesis
  7. 7

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

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

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

    Review of Nature Inspired Metaheuristic Algorithm Selection for Combinatorial t-way Testing by Muazu, A.A., Hashim, A.S., Sarlan, A.

    Published 2022
    “…Metaheuristic algorithm is a very important area of research that continuously improve in solving optimization problems. …”
    Get full text
    Get full text
    Article
  11. 11

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

    Enhanced Distributed Learning Classifier System For Simulated Mobile Robot Behaviours by Baneamoon, Saeed Mohammed Saeed

    Published 2010
    “…The aim of this research is to overcome the behaviour selection problem. This thesis proposes methods that can overcome the problems of good behaviour selection and good behaviour deletion. …”
    Get full text
    Get full text
    Thesis
  13. 13

    A review of genetic algorithms and parallel genetic algorithms on Graphics Processing Unit (GPU) by Mohd Johar, Fauzi, Azmin, Farah Ayuni, Suaidi, Mohd Kadim, Shibghatullah, Abdul Samad, Ahmad, Badrul Hisham, Salleh, Siti Nadzirah, Abdul Aziz, Mohd Zainol Abidin, Md Shukor, Mahfuzah

    Published 2013
    “…GAs is one of the optimization tools used widely in solving problems based on natural selection and genetics. This paper is intended to cover the study of GA and parallel GA and analyses its usage in CPU and GPU. …”
    Get full text
    Conference or Workshop Item
  14. 14
  15. 15

    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
  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
    “…The results show that the proposed algorithm can be employed as an algorithm to select the structure of the proposed model.…”
    Get full text
    Get full text
    Get full text
    Article
  17. 17

    Ant colony optimization for rule induction with simulated annealing for terms selection by Saian, Rizauddin, Ku-Mahamud, Ku Ruhana

    Published 2012
    “…This paper proposes a sequential covering based algorithm that uses an ant colony optimization algorithm to directly extract classification rules from the data set.The proposed algorithm uses a Simulated Annealing algorithm to optimize terms selection, while growing a rule.The proposed algorithm minimizes the problem of a low quality discovered rule by an ant in a colony, where the rule discovered by an ant is not the best quality rule, by optimizing the terms selection in rule construction. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  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
    “…The results show that the proposed algorithm can be employed as an algorithm to select the structure of the proposed model.…”
    Get full text
    Get full text
    Article
  19. 19

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

    Published 2004
    “…The results show that the proposed algorithm can be employed as an algorithm to select the structure of the proposed model.…”
    Get full text
    Get full text
    Article
  20. 20