Search Results - (( _ application tree algorithm ) OR ( its application ((graph algorithm) OR (path algorithm)) ))*

Refine Results
  1. 1

    IMPLEMENTATION OF GRAPH BASED PATH PLANNING ALGORITHMS FOR INDOOR NAVIGATION by SYED KHAIZURA, SYED HUSEIN KAMIL

    Published 2018
    “…In this study, we are looking at the performance of four graph-based path planning algorithms which is Breadth First Search, Depth First Search, Dijkstra and A*, when implemented in real world applications. …”
    Get full text
    Get full text
    Final Year Project
  2. 2
  3. 3
  4. 4

    Comparison of path planning in simulated robot by Ch’ng, Chee Yu’ng

    Published 2020
    “…This is because each path planning algorithm has its own applicable domain, performance, advantages and disadvantages in various situations. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  5. 5
  6. 6
  7. 7

    Modeling dynamic weight for 3D navigation routing by Musliman, Ivin Amri, Abdul Rahman, Alias, Coors, Volker

    Published 2007
    “…Currently, most of shortest path algorithm used in GIS application is often not sufficient for efficient management in time-critical applications such as emergency response applications. …”
    Get full text
    Get full text
    Conference or Workshop Item
  8. 8

    Improved tree routing protocol in zigbee networks by Al-Harbawi, Mostafa Kamil Abdulhusain

    Published 2010
    “…If any ZigBee router loses its link to its parent the routing path is broken and the TR cannot recover the routing path by itself , for that the second main objective is overcome the link failure problem. …”
    Get full text
    Get full text
    Thesis
  9. 9

    High-Speed shortest path co-processor design by Idris, Mohd Yamani Idna, Abu Bakar, Suraya, Tamil, Emran Mohd, Razak, Zaidi, Noor, Noorzaily Mohamed

    Published 2009
    “…Shortest path algorithms are significant in graph theory and have been applied in many applications such as transportation and networking. …”
    Get full text
    Get full text
    Conference or Workshop Item
  10. 10

    A matrix approach for minimum spanning tree in neutrosophic and application in medical waste management / Nur Haifa Ahmad Hayazim, Siti Nurain Zulkifli and Siti Nurhidayah Yaacob by Ahmad Hayazim, Nur Haifa, Zulkifli, Siti Nurain, Yaacob, Siti Nurhidayah

    Published 2022
    “…Many research works have been done to find an MST due to its various applications. In real-life problems, there are a variety of uncertainties that make determining the exact length of the arc extremely difficult. …”
    Get full text
    Get full text
    Student Project
  11. 11

    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
    “…K-shortest paths algorithm discovers a set of paths ordered in the most optimal, optimal, and suboptimal, has a very wide application is integrated into SDN controller to handle routing functionality. …”
    Get full text
    Get full text
    Article
  12. 12
  13. 13
  14. 14
  15. 15
  16. 16

    Path planning methods for autonomous vehicles at intersections: A review by Vinayak, Akhil, Muhammad Aizzat, Zakaria, Younus, Maryam, Mohamad Heerwan, Peeie, Muhammad Izhar, Ishak

    Published 2026
    “…Each method is analysed in terms of its strengths, limitations, and applicability to real-world scenarios, focusing on the specific demands of intersection navigation. …”
    Get full text
    Get full text
    Get full text
    Article
  17. 17
  18. 18
  19. 19
  20. 20

    Graph-Based Algorithm With Self-Weighted And Adaptive Neighbours Learning For Multi-View Clustering by He, Yanfang

    Published 2024
    “…Although the swmcan algorithm solves the noise problem in multi-view data, its initial and final graphs are independent and cannot learn from each other. …”
    Get full text
    Get full text
    Thesis