Search Results - (( program _ decomposition 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
  8. 8

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

    CSC773 - Parallel Computing / College of Computing, Informatics And Media by UiTM, College of Computing, Informatics And Media

    Published 2023
    “…It emphasizes the decomposition and mapping techniques in constructing parallel algorithms. …”
    Get full text
    Get full text
    Get full text
    Teaching Resource
  11. 11
  12. 12

    Analyzing students’ experience in programming with computational thinking through competitive, physical, and tactile games: The quadrilateral method approach by Habib, M. A. a, Raja-Yusof, R. -J., Salim, S. S.a, Sani, A. A. a, Sofian, H., Abu Bakar, A.

    Published 2021
    “…The CT elements in this research focus on four major programming concepts, which are decomposition, pattern recognition, abstraction, and algorithmic thinking. …”
    Get full text
    Get full text
    Get full text
    Article
  13. 13

    Recent research in cooperative path planning algorithms for multi-agent using mixed- integer linear programming by Che Ku, Nor Azie Hailma, Omar, Rosli, Sabudin Elia Nadira, Sabudin Elia Nadira

    Published 2016
    “…This paper will review and compare the performances of those existing methods that can find solution without graph search algorithm such as Mixed-Integer Linear Programming (MILP) techniques which exactly solves the problem and then propose four alternative MILP formulations which are computationally less intensive and suited for real-time purposes, but yield a theoretically guaranteed suboptimal solution.…”
    Get full text
    Get full text
    Article
  14. 14

    Dynamic Economic Dispatch For Large Scale Power Systems: A Lagrangian Relaxation Approach by Ab Ghani, Mohd Ruddin, Hindi, K. S.

    Published 1991
    “…The solution algorithm is based on Lagrangian relaxation and on exploiting the intimate relationship between optimizing the dual Lagrangian function and Dantzig-Wolfe decomposition. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  15. 15
  16. 16

    Integrated supply chain planning under uncertainty using an improved stochastic approach by Mohammadi Bidhandi, Hadi, Mohd Yusuff, Rosnah

    Published 2011
    “…In the improved solution method, the sample average approximation technique is integrated with the accelerated Benders’ decomposition approach to improvement of the mixed integer linear programming solution phase. …”
    Get full text
    Get full text
    Get full text
    Article
  17. 17

    Sensor Node Placement in Wireless Sensor Network Using Multi-objective Territorial Predator Scent Marking Algorithm by Zainol Abidin H., Din N.M., Yassin I.M., Omar H.A., Radzi N.A.M., Sadon S.K.

    Published 2023
    “…A simulation study has been carried out to compare the performance of the proposed algorithm with the multi-objective evolutionary algorithm with fuzzy dominance-based decomposition and an integer linear programming algorithm. …”
    Article
  18. 18

    Solving power system state estimation using orthogonal decomposition algorithm / Tey Siew Kian by Tey, Siew Kian

    Published 2009
    “…This optimal state estimate and corrected data base are then used by the security monitoring and operation and control functions of the center.Most state estimation programs in practical use are formulated as overdetermined systems (Pozrikidis, 2008) of nonlinear equations and solved as weighted least square problems (refer to section 2.1.1).This research involves finding the least squares solution of the power system state estimation problem, HTR-1HDx = HTR-1 [z - f (x)] (refer to section 2.3.1) and to develop a program to implement the said algorithm. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  19. 19

    SecPath: Energy efficient path reconstruction in wireless sensor network using iterative smoothing by Abd, Wamidh Jwdat

    Published 2019
    “…To achieve energy efficiency, it compresses the packet information by using GZIP tools in JAVA. SecPath is evaluated with several variations using 400 nodes in WSN deployments as well as large-scale simulations. …”
    Get full text
    Get full text
    Thesis
  20. 20

    Development of a new approach for deterministic supply chain network design by Bidhandi, Hadi Mohammadi, Mohd. Yusuff, Rosnah, Megat Ahmad, Megat Mohamad Hamdan, Abu Bakar, Mohd Rizam

    Published 2008
    “…Consequently, this problem is a binary mixed integer linear programming problem. In this paper, a modified version of Benders’ decomposition is proposed to solve the model. …”
    Get full text
    Get full text
    Get full text
    Article