Search Results - (( java implementation path algorithm ) OR ( basic spatial generation 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
    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:
  5. 5
    3D spatial operations in geo DBMS environment for 3D GIS

    3D spatial operations in geo DBMS environment for 3D GIS by Chen, Tet Khuan, Abdul Rahman, Alias

    Published 2007
    “…To formulate this research in a suitable way, our approach is to develop the new 3D data type, polyhedron, within geo-DBMS. The basic idea is to relate the implementation of intersection point in 3D planar polygon (Chen and Abdul-Rahman, 2006) into the geometrical modeling for 3D spatial operations. …”
    Get full text
    Get full text
    Book Section
    Save to List
    Saved in:
  6. 6
    Analysis of the Flood Extent Extraction Model and the Natural Flood Influencing Factors: A GIS-based and Remote Sensing Analysis

    Analysis of the Flood Extent Extraction Model and the Natural Flood Influencing Factors: A GIS-based and Remote Sensing Analysis by Dano Umar, Lawal, Matori, Abdul Nasir, Wan Yusof, Khamaruzaman, Balogun, Abdul-Lateef

    Published 2013
    “…The purpose of this paper is to develop a flood extent extraction model based on Minimum Distance Algorithm and to overlay with the natural flood influencing factors considered herein in order to examine the effect of each factor in flood generation. …”
    Get full text
    Get full text
    Conference or Workshop Item
    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
    One-dimension high-order compact method for solving euler's equation

    One-dimension high-order compact method for solving euler's equation by Mohamad, Mahmod Abd Hakim bin

    Published 2010
    “…Spatial discretization of the Euler equation is based on flux-vector splitting. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  9. 9
    One-dimensional high-order compact method for solving Euler's equations

    One-dimensional high-order compact method for solving Euler's equations by Mohamad, Mahmod Abd Hakim, Basri, Shahnor, Basuno, Bambang

    Published 2011
    “…Spatial discretization of the Euler equation is based on flux-vector splitting. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:

Search Tools: