Search Results - (( developing e graph algorithm ) OR ( java optimization path algorithm ))

Refine Results
  1. 1

    Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization by Mohammad Ata, Karimeh Ibrahim

    Published 2019
    “…BST inserts the nodes in the way that the Dijkstra’s can find the empty parking in fastest way. Dijkstra’s algorithm initials the paths to finding the shortest path while ACO optimizes the paths. …”
    Get full text
    Get full text
    Thesis
  2. 2

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

    Published 2019
    “…This work uses iterative smoothing algorithm to find an alternative path with less distance and energy consumption. …”
    Get full text
    Get full text
    Thesis
  3. 3

    Energy efficient path reconstruction in wireless sensor network using iPath by Hasan, Sazlinah, Abd, Wamidh Jwdat, Ariffin, Ahmad Alauddin

    Published 2019
    “…This work uses iterative boosting algorithm to find an alternative path with less distance and energy consumption. …”
    Get full text
    Get full text
    Get full text
    Article
  4. 4

    Visdom: Smart guide robot for visually impaired people by Lee, Zhen Ting

    Published 2025
    “…Core functionalities such as path planning, autonomous movement, voice feedback, and app-to-robot communication have been thoroughly tested and optimized. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  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

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

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

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

    Published 2012
    “…The algorithm consists of three new mechanisms that organize the work of an ant colony i.e. initial pheromone value mechanism, resource selection mechanism and pheromone update mechanism. …”
    Get full text
    Get full text
    Get full text
    Monograph
  9. 9

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

    Published 2011
    “…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
  10. 10

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

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

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

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

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

    Discrete simulation framework for wireless cellular networks. by Al-Sanabani, Maher Ali, K. Subramaniam, Shamala, Othman, Mohamed, Ahmad Zulkarnain, Zuriati

    Published 2008
    “…The performance of the developed simulator compared with the performance characteristics of existing algorithms. …”
    Get full text
    Get full text
    Article
  20. 20