Search Results - (( initial generation using algorithm ) OR ( java simulation optimization 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

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

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

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

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

    Solving Assembly Line Balancing Problem Using Genetic Algorithm With Heuristics-Treated Initial Population by Chong, Kuan Eng, Omar, Mohamed K, Abu Bakar, Nooh

    Published 2008
    “…Although genetic algorithm (GA) has been widely used to address assembly line balancing problems (ALBP), not much attention has been given to the population initialization procedure. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  9. 9

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

    MaxD K-Means: A clustering algorithm for auto-generation of centroids and distance of data points in clusters by Wan Maseri, Wan Mohd, Beg, Abul Hashem, Herawan, Tutut, Fazley Rabbi, Khandakar

    Published 2012
    “…In this paper, we propose a clustering technique called MaxD K-Means clustering algorithm. MaxD K-Means algorithm auto generates initial k (the desired number of cluster) without asking for input from the user. …”
    Get full text
    Get full text
    Get full text
    Article
  11. 11

    Assessing the chaotic map population initializations for sine cosine algorithm using the case study of pairwise test suite generation by Din, Fakhrud, Kamal Zuhairi, Zamli, Abdullah, Nasser

    Published 2022
    “…In this work, we propose to assess the effectiveness of pseudo random (i.e., Random) as well as three chaotic map initializations (i.e., sine map, circle map, and logistic map) for SCA using the pairwise test case generation as our case study. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  12. 12

    Handover initiation algorithm in hierarchical macrocell/femtocell In LTE network / Abdul Azim Mad Diah by Mad Diah, Abdul Azim

    Published 2013
    “…Therefore, in this paper the initiation algorithm are proposed when a user enters the coverage area of the femtocell or macrocell. …”
    Get full text
    Get full text
    Thesis
  13. 13

    Combining approximation algorithm with genetic algorithm at the initial population for NP-complete problem by Razip, H., Zakaria, M.N.

    Published 2018
    “…In Genetic Algorithm (GA), the prevalent approach to population initialization are heuristics and randomization. …”
    Get full text
    Get full text
    Article
  14. 14

    A firefly algorithm based hybrid method for structural topology optimization by Gebremedhen, H.S., Woldemichael, D.E., Hashim, F.M.

    Published 2020
    “…The lower and upper limit of design variables (0 and 1) were used to find initial material distribution to initialize the firefly algorithm based section of the hybrid algorithm. …”
    Get full text
    Get full text
    Article
  15. 15

    Enhanced Harris's Hawk algorithm for continuous multi-objective optimization problems by Yasear, Shaymah Akram

    Published 2020
    “…This indicates the capability of the algorithm in exploring the search space. The 2S-ENDSHHMO algorithm can be used to improve the search process of other MOSI-based algorithms and can be applied to solve MOPs in applications such as structural design and signal processing.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  16. 16

    Clustering ensemble learning method based on incremental genetic algorithms by Ghaemi, Reza

    Published 2012
    “…Moreover, experiments demonstrate that final clustering solution generated by the proposed incremental genetic-based clustering ensemble algorithm using the pattern ensemble learning method possess comparative or better clustering accuracy than clustering solutions generated by the incremental genetic-based clustering ensemble algorithms using other recombination operators. …”
    Get full text
    Get full text
    Thesis
  17. 17

    Autonomous and deterministic supervised fuzzy clustering by Lim, K.M., Loo, C.K., Lim, W.S.

    Published 2010
    “…This algorithm implements k-means to initialize the fuzzy model. …”
    Get full text
    Get full text
    Article
  18. 18

    Max-D clustering K-means algorithm for Autogeneration of Centroids and Distance of Data Points Cluster by Wan Maseri, Wan Mohd, Beg, Abul Hashem, Tutut, Herawan, K., F.Rabbi

    “…In this paper has been proposed a clustering technique called MaxD K-Means clustering algorithm. MaxD K-Means algorithm auto generates initial k (the desired number of cluster) without asking for input from the user. …”
    Get full text
    Get full text
    Get full text
    Article
  19. 19
  20. 20

    An Integrated RRT*SMART-A* Algorithm for solving the Global Path Planning Problem in a Static Environment by Suwoyo, Heru, Adriansyah, Andi, Andika, Julpri, Ubaidillah, Abu

    Published 2023
    “…In short, by involving A*, the exploration process for generating the Smart-RRT*’s initial path can be supported. …”
    Get full text
    Get full text
    Get full text
    Article