Search Results - (( solution construction a algorithm ) OR ( java simulation optimization algorithm ))

Refine Results
  1. 1

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

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

    Published 2012
    “…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 other ant based algorithm, in terms of resource utilization. …”
    Get full text
    Get full text
    Get full text
    Monograph
  3. 3

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

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

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

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

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

    Design and statistical analysis of initial solution construction approach in curriculum based course timetabling problem by Wahid, Juliana, Mohd Hussin, Naimah

    Published 2017
    “…To produce a population of initial solution require algorithm that can produce multiple feasible solutions and these solutions must be diverse. …”
    Get full text
    Get full text
    Conference or Workshop Item
  10. 10

    Enhanced Intelligent Water Drops Algorithm for University Examination Timetabling Problems by Bashar AbedAl Mohdi Talal AlDeeb

    Published 2024
    “…(iii) It is a constructive-based meta-heuristic algorithm which means, the solution is incrementally constructed (step by step) until the complete solution is obtained (Noferesti and Shah-Hosseini, 2012). …”
    thesis::doctoral thesis
  11. 11
  12. 12

    A hybrid adaptive harmony search with modified great deluge algorithm for school timetabling by Arbaoui, Billel

    Published 2025
    “…In Phase 1, heuristic rules refine the time assignment stage to improve an existing construction algorithm. Phase 2 adaptively tunes parameters based on iteration position, solution number, behavioral status, and parameter linkages. …”
    Get full text
    Get full text
    Thesis
  13. 13

    Utilizing the roulette wheel based social network search algorithm for substitution box construction and optimization by Kamal Z., Zamli, Alhadawi, Hussam S., Fakhrud Din, .

    Published 2023
    “…This paper introduces a new variant of a recent metaheuristic algorithm based on the Social Network Search algorithm (SNS), which is called the Roulette Wheel Social Network Search algorithm (SNS). …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  14. 14

    The Anglerfish algorithm: a derivation of randomized incremental construction technique for solving the traveling salesman problem by Pook, Mei Foong, Ramlan, Effirul Ikhwan

    Published 2019
    “…Combinatorial optimization focuses on arriving at a globally optimal solution given constraints, incomplete information and limited computational resources. …”
    Get full text
    Get full text
    Article
  15. 15

    Sequential constructive algorithm incorporate with fuzzy logic for solving real world course timetabling problem by Tan, Li June, Joe H. Obit, Leau, Yu Beng, Jetol Bolongkikit, Rayner Alfred

    Published 2020
    “…Sequential constructive algorithm is one of the popular methods for solving timetabling problems. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  16. 16

    Optimised Crossover Genetic Algorithms for Combinatorial Optimisation Problems by Nazif, Habibeh

    Published 2010
    “…A Genetic Algorithm is successful in generating near -optimal solutions if it is able to produce o®spring during crossover that is better than the parent solutions. …”
    Get full text
    Get full text
    Thesis
  17. 17
  18. 18

    An Efficient Computational Algorithm for Solving Arbitrary Sylvester Matrix Equations in Fuzzy Control Theory (S/O 14179) by Ahmad, Nazihah, Ibrahim, Haslinda

    Published 2021
    “…As a result, the constructed algorithm has successfully demonstrated the solutions for the arbitrary FFSME, with minimum complexity of the fuzzy operations. …”
    Get full text
    Get full text
    Monograph
  19. 19

    Development of a scheduling tool for constructing a Malaysian school timetable using genetic algorithms / Salihin Farag Shoeeb by Salihin Farag , Shoeeb

    Published 2003
    “…A recent approach to derive a near-optimal solution is to use evolutionary or genetic algorithms. …”
    Get full text
    Get full text
    Thesis
  20. 20

    Enhancement of Ant System Algorithm for Course Timetabling Problem by Djamarus, Djasli

    Published 2009
    “…For this kind of problem, researchers believe that it will be better to find an approximate solution that can be delivered by a stochastic algorithm than waiting for an exact solution from the deterministic algorithm. …”
    Get full text
    Get full text
    Get full text
    Thesis