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

    Solving Blasius equation using semi analytic iterative method / Nurul Atikah Halmi and Nur Azyyati Ayob by Halmi, Nurul Atikah, Ayob, Nur Azyyati

    Published 2018
    “…Blasius equation is known as a basic unsolidified dynamics equation. Many methods were approached to solve this problem but a new method has been conducted to resolve this difficulty which is semi analytic iterative method (SAIM). …”
    Get full text
    Get full text
    Student Project
  5. 5
  6. 6

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

    Published 2015
    “…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
  7. 7
  8. 8
  9. 9
  10. 10

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

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

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

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

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

    Interval iterative methods on simultaneous inclusion of polynomial zeros by Mohammad Rusli, Syaida Fadhilah

    Published 2017
    “…To begin with, the basic concepts of interval computations and some brief introductions on Newton’s method are provided. …”
    Get full text
    Get full text
    Thesis
  18. 18

    Avoiding under-reaching in twin circuit lines without residual current input from the parallel line by Mukerjee R.N., Bin Abdullah M.F., Tan K.K., Nallagownden P.

    Published 2023
    “…The paper develops characteristic expressions for the effective sequence impedances experienced by a twin-circuit, both with and without mutual coupling and presents a non-iterative microprocessor based real time algorithm for computing fault distance and zero sequence compensation in basic distance relaying scheme, Residual current measurement from the parallel circuit is not required in the algorithm. � 2007 RPS.…”
    Conference Paper
  19. 19

    Application of genetic algorithm and JFugue in an evolutionary music generator by Tang, Jia Rou

    Published 2025
    “…This project explores the application of Genetic Algorithms (GA) with JFugue, which is a Java-based music programming library to develop an Evolutionary Music Generator. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  20. 20

    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