Search Results - (( programming problem graph algorithm ) OR ( java application optimization algorithm ))

Refine Results
  1. 1

    Ant colony optimization algorithm for load balancing in grid computing by Ku-Mahamud, Ku Ruhana, Mohamed Din, Aniza

    Published 2012
    “…The resource allocation problem is modelled as a graph that can be used by the ant to deliver its pheromone.This graph consists of four types of vertices which are job, requirement, resource and capacity that are used in constructing the grid resource management element. …”
    Get full text
    Get full text
    Get full text
    Monograph
  2. 2

    Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing by Husna, Jamal Abdul Nasir

    Published 2011
    “…The resource allocation problem is modeled as a graph that can be used by the ant to deliver its pheromone. …”
    Get full text
    Get full text
    Get full text
    Thesis
  3. 3

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

    An improved algorithm for channel allocation on direct sequence spread spectrum by Handrizal, M

    Published 2011
    “…Meanwhile between the VMA and Dsatur algorithm in the complex graph is equivalent to 18.1%.However,VMA and Welsh Powell algorithm is not compared in the complex graph since its drawback in terms of not fulfill the graph coloring concept.This is because there are two adjacent vertices have the same color.Overall, even there is no reduction for number of required channel among VMA,Dsatur algorithm and Welsh Powell algorithm in the simple graph,but the outstanding significant contribution of VMA since it has reduction in the complex graph.…”
    Get full text
    Get full text
    Thesis
  5. 5
  6. 6
  7. 7
  8. 8

    Graph theory approach for managing lecturers’ schedule using graph colouring method / Siti Nor Ba Basri, Nur Su’aidah Khozaid and Farhana Hazwani Ismail by Basri, Siti Nor Ba, Khozaid, Nur Su’aidah, Ismail, Farhana Hazwani

    Published 2023
    “…This study seeks to optimize the scheduling process by employing a graph theory approach with graph colouring method, as well as results validation by Integer Linear Programming (ILP) based on the graph colouring outcome by using the Phyton programming software, to effectively assign time slots for courses and lecturers while managing the risk of clashes and omissions. …”
    Get full text
    Get full text
    Student Project
  9. 9

    Enhancement of Ant System Algorithm for Course Timetabling Problem by Djamarus, Djasli

    Published 2009
    “…As the requirement of the Ant System Algorithm, the problem is modeled as a graph that can be used by the ant to deliver its pheromone. …”
    Get full text
    Get full text
    Get full text
    Thesis
  10. 10
  11. 11

    Performance evaluation of real-time multiprocessor scheduling algorithms by Alhussian, H., Zakaria, N., Abdulkadir, S.J., Fageeri, S.O.

    Published 2016
    “…These results suggests that optimal algorithms may turn to be non-optimal when practically implemented, unlike USG which reveals far less scheduling overhead and hence could be practically implemented in real-world applications. …”
    Get full text
    Get full text
    Conference or Workshop Item
  12. 12
  13. 13

    Route Optimization System by Zulkifli, Abdul Hayy

    Published 2005
    “…After much research into the many algorithms available, and considering some, including Genetic Algorithm (GA), the author selected Dijkstra's Algorithm (DA). …”
    Get full text
    Get full text
    Final Year Project
  14. 14
  15. 15
  16. 16
  17. 17
  18. 18
  19. 19

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

    Design of DNA fragment assembly using IWP method on application-specific integrated-circuit / Hasniliati Hassan by Hassan, Hasniliati

    Published 2017
    “…After reviewing various algorithms, it was decided to apply de Bruijn graphs and Eulerian circuits that are based on graph theory. …”
    Get full text
    Get full text
    Thesis