Search Results - (( java implementation path algorithm ) OR ( knowledge implementation graph algorithm ))

  • Showing 1 - 16 results of 16
Refine Results
  1. 1

    Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer by Ahmad Nezer, Nurul Aqilah

    Published 2017
    “…The development tools used in developing this project is NetBeans by using Java for the implementation of the coding. The methodology that used for developing this system is the Dijkstra’s algorithm. …”
    Get full text
    Get full text
    Thesis
  2. 2

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

    Path planning for unmanned aerial vehicle (UAV) using rotated accelerated method in static outdoor environment by Shaliza Hayati A. Wahab, Nordin Saad, Azali Saudi, Ali Chekima

    Published 2021
    “…In this study, a fast iterative method known as Rotated Successive Over-Relaxation (RSOR) is introduced. The algorithm is implemented in a self-developed 2D Java tool, UAV Planner. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  4. 4

    Optimizing boarding school schedule using graph colouring : case study of Sekolah Menengah Sultan Abdul Halim / Nur Farhana Mohd Asri by Mohd Asri, Nur Farhana

    Published 2021
    “…The result has shown that the Greedy Algorithm has succeeded to produce the lowest minimal color compared to Graph Coloring Algorithm. …”
    Get full text
    Get full text
    Student Project
  5. 5

    Optimizing boarding school schedule using graph coloring: case study of Sekolah Menengah Sultan Abdul Halim / Nur Farhana Mohd Asri by Mohd Asri, Nur Farhana

    Published 2022
    “…The result has shown that the Greedy Algorithm has succeeded to produce the lowest minimal color compared to Graph Coloring Algorithm. …”
    Get full text
    Get full text
    Research Reports
  6. 6

    The conceptual framework of knowledge of large scale and incomplete graphs of skyline queries optimization using machine learning by Noor, Ubair, Hassan, Raini, Dwi Handayani, Dini Oktarina

    Published 2025
    “…The implemented algorithm to perform such operation was far more efficient, faster and accurate as compared to conventional methods. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Proceeding Paper
  7. 7

    Smart appointment organizer for mobile application / Mohd Syafiq Adam by Adam, Mohd Syafiq

    Published 2009
    “…The main component of this prototype is the use of Dijkstra algorithm to compute the shortest path from source of appointment to the 6 points of destinations within UiTM Shah Alam. …”
    Get full text
    Get full text
    Thesis
  8. 8

    Optimizing schedule of boarding school using vertex and edge coloring approach / Nurhuda Ismail, Siti Sarah Raseli and Nur Farhana Mohd Asri by Ismail, Nurhuda, Raseli, Siti Sarah, Mohd Asri, Nur Farhana

    Published 2021
    “…Greedy Algorithm has been used to solve the Vertex Coloring approach while Graph Coloring Algorithm has been used to solve the Edge Coloring approach. …”
    Get full text
    Get full text
    Get full text
    Article
  9. 9
  10. 10

    A case study on quality of sleep and health using Bayesian networks by Hong , Choon Ong, Chiew , Seng Lee, Chye , Ching Sia

    Published 2012
    “…There are several phases involved including implementation of the learning algorithms, integration of prior knowledge through the whitelist argument and arc setting to form directed acyclic graphs. …”
    Get full text
    Article
  11. 11

    Determining Intermediary Closely Related Languages to Find a Mediator for Intertribal Conflict Resolution by Nasution, A.H., Fitri, S.E., Saian, R., Monika, W., Badruddin, N.

    Published 2022
    “…To address this problem, we aim to find intermediary closely related languages from a language similarity knowledge graph using the best-performing pathfinding algorithms. …”
    Get full text
    Get full text
    Article
  12. 12

    Ontology enrichment with causation relations by Amaal Saleh Hassan, Al Hashimy, Narayanan, Kulathuramaiyer

    Published 2014
    “…Ontology learning is considered a potential approach that can help to reduce the bottleneck of knowledge acquisition. However it suffers from a lack of standards to define concepts, besides the lack of fully automatic knowledge acquisition methods. …”
    Get full text
    Get full text
    Get full text
    Article
  13. 13

    Global Mobile Robot Path Planning using Laser Simulator by Ali, Mohammed A. H., Wan Azhar, Wan Yusoff, Zamzuri, Hamedon, Zulkifli, Md. Yusof, Musa, Mailah

    Published 2017
    “…The developed laser simulator is implemented successfully in these environments and the simulation results are compared with the classical A* algorithm. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  14. 14

    Keyword query processing interface model of ontological natural language manipulation by Hasany, Syed Muhammad Noman

    Published 2010
    “…To handle large keyword queries, graph representation and processing is considered as a bottleneck. …”
    Get full text
    Get full text
    Thesis
  15. 15

    A test case generation framework based on UML statechart diagram by Salman, Yasir Dawood

    Published 2018
    “…The proposed algorithms provide correct results, and the prototype is able to generate test case effectively. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  16. 16

    Evolutionary cost-cognizant regression test case prioritization for object-oriented programs by Bello, AbdulKarim

    Published 2019
    “…Therefore, this study proposed a cost-cognizant TCP approach for object-oriented software that uses path-based integration testing to identify the possible execution path extracted from the Java System Dependence Graph (JSDG) model of the source code using forward slicing technique. …”
    Get full text
    Get full text
    Thesis