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

Refine Results
  1. 1
  2. 2

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

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

    A new starter sets generation method by fixing any element under exchange restriction by Karim, Sharmila, Ibrahim, Haslinda, Omar, Zurni, Sapiri, Hasimah

    Published 2016
    “…A new method is developed for starter sets generation namely STARSET2 based on exchange where any element can be selected randomly to be fixed.The result showed that no redundancy of starter sets is occurring and no equivalence starter sets are obtained.…”
    Get full text
    Get full text
    Article
  5. 5
  6. 6

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

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

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

    Identifying and detecting unlawful behavior in video images using genetic algorithm / Shahirah Mohamed Hatim by Mohamed Hatim, Shahirah

    Published 2016
    “…Two types of selection parameter namely tournament selection (TOS) and random permutation selection (RPS) are chosen. …”
    Get full text
    Get full text
    Thesis
  10. 10

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

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

    Flowshop scheduling using artificial bee colony (ABC) algorithm with varying onlooker bees approaches by Mohd Pauzi, Nur Fazlinda

    Published 2015
    “…At high iterations of 204 and above, method 3+0+0 dominates the best performance. Based on this finding, the selection of the best method can be decided based on the iteration time available. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  13. 13
  14. 14

    A new method for starter sets generation by fixing any element by Karim, Sharmila, Ibrahim, Haslinda, Sapiri, Hasimah

    Published 2015
    “…A new method is developed for starter sets generation namely STARSET1 based on circular where any element can be selected randomly to be fixed. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  15. 15
  16. 16

    Dynamic determinant matrix-based block cipher algorithm by Juremi, Julia

    Published 2018
    “…This research also proposes a new method namely RotateSwapDeterminant function that uses rotation and swapping of the bit based on the 4x4 determinant computations and will act as the permutation layer in the DDBC algorithm. …”
    Get full text
    Get full text
    Thesis
  17. 17

    A Simulated Annealing-Based Hyper-Heuristic For The Flexible Job Shop Scheduling Problem by Kelvin, Lim Ching Wei

    Published 2023
    “…Given a wide range of MAR-JSR permutations, selecting a suitable MAR-JSR pair for a FJSP becomes a challenge. …”
    Get full text
    Get full text
    Thesis
  18. 18

    Hybrid-discrete multi-objective particle swarm optimization for multi-objective job-shop scheduling by Anuar, Nurul Izah

    Published 2022
    “…This research first proposes an improved continuous MOPSO to address the rapid clustering problem that exists in the basic PSO algorithm using three improvement strategies: re-initialization of particles, systematic switch of best solutions and mutation on global best selection. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  19. 19

    TOPSIS-Based service arbitration for autonomic Internet of things by Ashraf, Qazi Mamoon, Habaebi, Mohamed Hadi, Islam, Md Rafiqul

    Published 2016
    “…The approach for the service arbitration scheme is based on the technique for order preference by similarity to ideal solution (TOPSIS) algorithm. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  20. 20