Search Results - (( java application optimization algorithm ) OR ( from information path algorithm ))

Refine Results
  1. 1
  2. 2

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

    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
  4. 4
  5. 5
  6. 6
  7. 7
  8. 8
  9. 9
  10. 10

    The performance effect due to varying network topologies on a software-defined network employing the k-shortest path by Linsheng, R., Derahman, M. N., Kadir, M. F. A., Mohamed, M. A., Kamarudin, S.

    Published 2022
    “…SDN controller uses the Dijkstra algorithm to find the shortest path calculated from the source node to the destination node. …”
    Get full text
    Get full text
    Article
  11. 11

    A comprehensive overview of classical and modern route planning algorithms for self-driving mobile robots by Wan Daud, Wan Mohd Bukhari, Abu, Nur Syuhadah, Omar, Siti Nashayu, Sohaimeh, Shahirul Ashraf, Adli,, M. H.

    Published 2022
    “…Before a robot can reliably and effectively navigate a space without human aid, there are still several challenges to be addressed. When planning a path to its destination, the robot should be able to gather information from its surroundings and take the appropriate actions to avoid colliding with obstacles along the way. …”
    Get full text
    Get full text
    Get full text
    Article
  12. 12

    Performance of Ad-Hoc on-Demand Distance Vector Discovery Algorithms Based On Packet Lifetime by Ahmad, Noor Azlan

    Published 2008
    “…AODV uses a distance or hop count for determining the best forwarding path and store the sequence number at table entry to ensure the path information is up-to-date. …”
    Get full text
    Get full text
    Thesis
  13. 13
  14. 14

    Path Planning Using Image Captured By Overhead Camera by Shamsul Azman, Muhammad Ameer

    Published 2016
    “…Finally, a path will be plotted using this information.…”
    Get full text
    Get full text
    Final Year Project
  15. 15
  16. 16
  17. 17

    A hybrid sampling-based path planning algorithm for mobile robot navigation in unknown environments by Khaksar, Weria

    Published 2013
    “…The motion planning problem poses the question of how a robot can move from an initial to a final position. Sampling-based motion planning is a class of randomized path planning algorithms with proven completeness. …”
    Get full text
    Get full text
    Thesis
  18. 18

    Railway shortest path planner application using ant colony optimization algorithm / Muhammad Hassan Firdaus Ruslan by Ruslan, Muhammad Hassan Firdaus

    Published 2017
    “…For the process module, Ant Colony Optimization (ACO) algorithm was used to find the shortest path. Using ACO, a Railway Shortest Path Planner (RSPP) application will be developed to help user determine their shortest path from one station to another. …”
    Get full text
    Get full text
    Thesis
  19. 19

    UiTM Malaysia route planner / Mohamad Yunus Mohamed Nasir by Mohamed Nasir, Mohamad Yunus

    Published 2008
    “…The Route Planner's core is Dijkstra's shortest-path-finding algorithm, with extensions for time dependent delays and paths constrained by travel mode. …”
    Get full text
    Get full text
    Thesis
  20. 20

    Development of web-based GIS for traffic management system with obstacle avoidance technique using open source software by Nik Yusoff, Nik Mohd Ramli

    Published 2014
    “…In order to calculate the shortest path between two nodes, Dijkstra algorithm was utilized. …”
    Get full text
    Get full text
    Thesis