Search Results - (( development _ discretization algorithm ) OR ( java simulation optimization algorithm ))

Refine Results
  1. 1

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

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

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

    Modification of particle swarm optimization algorithm for optimization of discrete values by Mohd Yassin, Ahmad Ihsan, Jusoh, Muhammad Huzaimy, Abdul Rahman, Farah Yasmin

    Published 2011
    “…Several methods have been developed for it to perform discrete-valued optimizations. …”
    Get full text
    Get full text
    Research Reports
  7. 7

    Implementation of New Improved Round Robin (NIRR) CPU scheduling algorithm using discrete event simulation by Chang, Jan Voon, Ahmad, Idawaty

    Published 2016
    “…However the lack of details of general NIRR simulation model is a clear limitation for the further improvement of the algorithm. The main objective of this research is to validate the NIRR algorithm by developing a comprehensive simulation model using Discrete Event Simulation (DES). …”
    Get full text
    Get full text
    Get full text
    Article
  8. 8

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

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

    Multi-state PSO GSA for solving discrete combinatorial optimization problems by Ismail, Ibrahim

    Published 2016
    “…These four algorithms can be used to solve discrete combinatorial optimization problems (COPs). …”
    Get full text
    Get full text
    Thesis
  11. 11

    Model structure selection for a discrete-time non-linear system using a genetic algorithm by Ahmad, R., Jamaluddin, H., Hussain, M. A.

    Published 2004
    “…In this paper, a methodology for model structure selection based on a genetic algorithm was developed and applied to non-linear discrete-time dynamic systems. …”
    Get full text
    Get full text
    Article
  12. 12

    Model structure selection for a discrete-time non-linear system using a genetic algorithm by Ahmad, R., Jamaluddin, H., Hussain, M. A.

    Published 2004
    “…In this paper, a methodology for model structure selection based on a genetic algorithm was developed and applied to non-linear discrete-time dynamic systems. …”
    Get full text
    Get full text
    Article
  13. 13

    Model structure selection for a discrete-time non-linear system using genetic algorithm by Ahmad, Robiah, Jamaluddin , Hishamuddin, Hussain, Mohd. Azlan

    Published 2004
    “…In this paper, a methodology for model structure selection based on a genetic algorithm was developed and applied to non-linear discrete-time dynamic systems. …”
    Get full text
    Get full text
    Get full text
    Article
  14. 14

    Implementation of New Improved Round Robin (NIRR) CPU scheduling algorithm using discrete event simulation by Chang, Jan Voon

    Published 2015
    “…However the lack of details of general NIRR simulation model is a clear limitation for the further improvement of the algorithm. The main objective of this research is to validate the NIRR algorithm by developing a comprehensive simulation model using Discrete Event Simulation (DES). …”
    Get full text
    Get full text
    Thesis
  15. 15

    A discrete event simulation framework for utility accrual scheduling algorithm in uniprocessor environment by Ahmad, Idawaty, K. Subramaniam, Shamala, Othman, Mohamed, Ahmad Zukarnain, Zuriati

    Published 2011
    “…Approach: The study focused on the proposed and the development of an event based discrete event simulator for the existing General Utility Scheduling (GUS) to facilitate the reuse of the algorithm under a common simulation environment. …”
    Get full text
    Get full text
    Get full text
    Article
  16. 16

    A Novel Discrete Filled Function Algorithm in Solving Discrete Optimization Problems (S/O: 12408) by Woon, Siew Fang, Karim, Sharmila, Mohamad, Mohd Saiful Adli

    Published 2016
    “…Several global methods have been proposed for solving discrete optimization problems. We focus our study on a recently developed method known as discrete filled function method. …”
    Get full text
    Get full text
    Monograph
  17. 17

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

    Multivariable system identification for dynamic discrete-time nonlinear system using genetic algorithm by Ahmad, R., Jamaluddin, H., Hussain, Mohd Azlan

    Published 2002
    “…The development of a multivariable system identification model for dynamic discrete-time nonlinear system using genetic algorithm was discussed and analysed. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  19. 19

    Multivariable system identification for dynamic discrete-time nonlinear system using genetic algorithm by Ahmad, R., Jamaluddin, H., Hussain, M. A.

    Published 2002
    “…The development of a multivariable system identification model for dynamic discrete-time nonlinear system using genetic algorithm was discussed and analysed. …”
    Get full text
    Get full text
    Conference or Workshop Item
  20. 20

    Chebyshev approximation of discrete polynomials and splines by Che Seman, Fauziahanim

    Published 2004
    “…A total of five algorithms based on the Lagrange polynomials and cubic splines have been developed in this work to identify the extreme points. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis