Search Results - (( developing e graph algorithm ) OR ( java simulation 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
    “…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 other ant based algorithm, in terms of resource utilization. …”
    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
    “…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

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

    Modeling of static and dynamic components of bio-nanorobotic systems by Gavgani, Hamidreza Khataee

    Published 2012
    “…This work focuses on the current library of components for the development of bio-nanorobots and considers the recently reported static (e.g. …”
    Get full text
    Get full text
    Thesis
  6. 6

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

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

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

    Preliminary framework of topology control algorithm in WSN to achieve node's energy efficiency by Shahabuddin, M.Z., Hasbullah, H., Aziz, I.A.

    Published 2016
    “…The algorithm works-out locally and dispenses full graph connectivity, and theoretically would be able to reduce WSN control overhead. …”
    Get full text
    Get full text
    Conference or Workshop Item
  11. 11

    Computationally-efficient path planning algorithms in obstacle-rich environments based on visibility graph method by Abdul Latip, Nor Badariyah

    Published 2018
    “…Cun·ent studies have been focused on developing path planning algorithms to satisfy the criteria of path planning namely minimum path length, low computation time and complete, i.e., it gives positive result if a path is available or negative if otherwise. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  12. 12

    Investigating and developing the best method in shortest path for implementing a geographical information system (e-map) for Peninsular Malaysia by Ahmad, Ab. Rahman, Zenon , Nasaruddin, Hassan, Haswadi

    Published 2005
    “…A development of GIS database is also involved in prototype covering the road network in Peninsular Malaysia (the e-map) will be developed to show the viability or validity of the findings. …”
    Get full text
    Get full text
    Monograph
  13. 13
  14. 14

    Key concept identification: A comprehensive analysis of frequency and topical graph-based approaches by Aman, M., Said, A.M., Kadir, S.J.A., Ullah, I.

    Published 2018
    “…The objective of the study presented in this paper is to perform a comprehensive empirical analysis of selected frequency and topical graph-based algorithms for key concept extraction on three different datasets, to identify the major sources of error in these approaches. …”
    Get full text
    Get full text
    Article
  15. 15

    Key concept identification: A comprehensive analysis of frequency and topical graph-based approaches by Aman, M., Said, A.M., Kadir, S.J.A., Ullah, I.

    Published 2018
    “…The objective of the study presented in this paper is to perform a comprehensive empirical analysis of selected frequency and topical graph-based algorithms for key concept extraction on three different datasets, to identify the major sources of error in these approaches. …”
    Get full text
    Get full text
    Article
  16. 16
  17. 17

    Examination timetable scheduling system (ETSS) / Fong Teng Heng by Fong, Teng Heng

    Published 2000
    “…The algorithm using can be referred to Graph colouring. …”
    Get full text
    Get full text
    Thesis
  18. 18
  19. 19
  20. 20