Search Results - (( java simulation optimization algorithm ) OR ( basic comparing search 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

    Local search manoeuvres recruitment in the bees algorithm by Muhamad, Zaidi, Mahmuddin, Massudi, Nasrudin, Mohammad Faidzul, Sahran, Shahnorbanun

    Published 2011
    “…Swarm intelligence of honey bees had motivated many bioinspired based optimisation techniques. The Bees Algorithm (BA) was created specifically by mimicking the foraging behavior of foraging bees in searching for food sources.During the searching, the original BA ignores the possibilities of the recruits being lost during the flying.The BA algorithm can become closer to the nature foraging behavior of bees by taking account of this phenomenon.This paper proposes an enhanced BA which adds a neighbourhood search parameter which we called as the Local Search Manoeuvres (LSM) recruitment factor.The parameter controls the possibilities of a bee extends its neighbourhood searching area in certain direction.The aim of LSM recruitment is to decrease the number of searching iteration in solving optimization problems that have high dimensions.The experiment results on several benchmark functions show that the BA with LSM performs better compared to the one with basic recruitment.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  5. 5
  6. 6

    Block based motion vector estimation using fuhs16 uhds16 and uhds8 algorithms for video sequence by S. S. S. , Ranjit

    Published 2011
    “…Full search (FS), three step search (TSS), new three step search (NTSS), diamond search (DS) and hexagon based search (HS) are the most well known block-matching algorithm. …”
    Get full text
    Get full text
    Get full text
    Book Chapter
  7. 7

    Block matching algorithms for motion estimation using modified Cross-Diamond-Hexagonal search / Abd Razak Mahmud by Mahmud, Abd Razak

    Published 2008
    “…This algorithm basically employs two crossshaped search patterns consecutively in the very beginning steps and switch using diamond-shaped patterns. …”
    Get full text
    Get full text
    Thesis
  8. 8

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

    Hybridflood algorithms minimizing redundant messages and maximizing efficiency of search in unstructured P2P networks by Barjini, Hassan

    Published 2012
    “…In the second step the algorithm follows a teeming search. QuickFlood compared with blocking expanding ring search decreased redundant messages by 70%, increased two-time success rate and decreased latency by 30%. …”
    Get full text
    Get full text
    Thesis
  11. 11

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

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

    T-way testing : a test case generator based on melody search algorithm by Toh, Shu Yuen

    Published 2015
    “…Next, TTT-MS will be executed through main algorithms to generate Parameters Interaction List, Parameter Values Interaction List, and finally generate final Test Cases based on Melody Search Algorithm. …”
    Get full text
    Get full text
    Undergraduates Project Papers
  14. 14

    Tackling the berth allocation problem via harmony search algorithm by Ahmed, Bilal, Hamdan, Hazlina, Muhammed, Abdullah, Husin, Nor Azura

    Published 2024
    “…Therefore, in this article, the basic HSA is proposed to tackle the BAP. The suggested HSA is tested on BAP benchmark (I3 dataset) and compared the results with other latest algorithms found in the literature. …”
    Get full text
    Get full text
    Get full text
    Article
  15. 15

    Comparison of path planning in simulated robot by Ch’ng, Chee Yu’ng

    Published 2020
    “…There are 4 path planning algorithms will be compared, which are Dijkstra’s algorithm, A* algorithm, RapidExploring Random Tree (RRT) algorithm, and the last one is an algorithm modified from A*. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  16. 16

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

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

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

    Published 2022
    “…In order to accomplish better performance by improving the search quality and efficiency of the discrete MOPSO, this research proposes a hybrid with the Diversification Generation Method in Scatter Search, the non-dominated sorting mechanism in non-dominated sorting Genetic Algorithm II (NSGA-II) and the local search mechanism in Tabu Search. …”
    Get full text
    Get full text
    Get full text
    Thesis
  20. 20

    African Buffalo Optimization Algorithm for Tuning Parameters of a PID Controller in Automatic Voltage Regulators by Odili, Julius Beneoluchi, M. N. M., Kahar, Noraziah, Ahmad

    Published 2016
    “…Though a recently-designed algorithm, the ABO has been effective and efficient in solving a number of search optimization problems. …”
    Get full text
    Get full text
    Get full text
    Article