Search Results - (( developing programme graph algorithm ) OR ( java implementation path algorithm ))

Search alternatives:

  • Showing 1 - 9 results of 9
Refine Results
  1. 1
    Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer

    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
    Save to List
    Saved in:
  2. 2
    Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization

    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
    Save to List
    Saved in:
  3. 3
    Path planning for unmanned aerial vehicle (UAV) using rotated accelerated method in static outdoor environment

    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
    Save to List
    Saved in:
  4. 4
    Graph processing hardware accelerator for shortest path algorithms in nanometer very large-scale integration interconnect routing

    Graph processing hardware accelerator for shortest path algorithms in nanometer very large-scale integration interconnect routing by Ch'ng, Heng Sun

    Published 2007
    “…Graphs are pervasive data structures in computer science, and algorithms working with them are fundamental to the field. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  5. 5
    Smart appointment organizer for mobile application / Mohd Syafiq Adam

    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
    Save to List
    Saved in:
  6. 6
    Examination timetabling for undergraduate programme using graph coloring approach / Norarida Abd Rhani ... [et al.]

    Examination timetabling for undergraduate programme using graph coloring approach / Norarida Abd Rhani ... [et al.] by Abd Rhani, Norarida, Mat Saad, Nor Najihah, Zulkfeli, Nabilah, Mazlan, Mardhiyah Marisha, Mahmud, Maziah, Mohamad, Siti Nurul Fitriah, Wan Yusoff, Wan Roslini

    Published 2021
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  7. 7
    Evolutionary cost-cognizant regression test case prioritization for object-oriented programs

    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
    Save to List
    Saved in:
  8. 8
    Using genetic algorithms to optimise land use suitability

    Using genetic algorithms to optimise land use suitability by Pormanafi, Saeid

    Published 2012
    “…In this study, under environmentfriendliness objective, based on multi-agent genetic algorithms, was developed a geospatial model for the land use allocation. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  9. 9
    Vector evaluated particle swarm optimization approach to solve assembly sequence planning problem

    Vector evaluated particle swarm optimization approach to solve assembly sequence planning problem by A. Mukred, Jameel A., A. Rahim, Ruzairi, Mohamad, Elmy Johana, Salh, Adeeb, Ashyap, Adel Y. I., Abdullah, Qazwan, AL-Fadhali, Najib, Al-Ameri, S., Al-Ashwal, Rania

    Published 2022
    “…An integrated approach such that liaison graph represents the physical connections between two components [15]. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: