Search Results - (( java implementation path algorithm ) OR ( using complex path algorithm ))

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

    High Rise Building Evacuation Route Model Using DIJKSTRA'S Algorithm by Mohd Sabri, Nor Amalina

    Published 2015
    “…This research aims to assist the evacuees to find the shortest path in a high rise building using a shortest path algorithm. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  5. 5

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

    A generalized laser simulator algorithm for optimal path planning in constraints environment by Aisha, Muhammad

    Published 2022
    “…A statistical test was used to demonstrate the efficiency of the proposed algorithm over the compared methods. …”
    Get full text
    Thesis
  10. 10

    False path identification algorithm framework for nonseparable controller-data path circuits by Shaheen, Ateeq U. R., Hussin, Fawnizu Azmadi, Hamid, Nor Hisham

    Published 2016
    “…In order to achieve the less test generation complexity, design-for-testability (DFT) techniques are used which causes untestable paths to be testable. …”
    Get full text
    Get full text
    Conference or Workshop Item
  11. 11
  12. 12

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

    Published 2007
    “…It has been shown that the performance of a graph-based shortest path algorithm can severely be affected by the performance of its priority queue. …”
    Get full text
    Get full text
    Get full text
    Thesis
  13. 13

    Nlfxlms and thf-nlfxlms algorithms for wiener-hammerstein nonlinear active noise control by Srazhidinov, Radik

    Published 2016
    “…However, this assumption may lead to inaccurate secondary path model. In this work, the modelling of acoustic path using FIR filters is incorporated for both algorithms for Wiener-Hammerstein structure. …”
    Get full text
    Get full text
    Thesis
  14. 14

    False path identification algorithm framework for nonseparable controller-data path circuits by Shaheen, A.-U.-R., Hussin, F.A., Hamid, N.H.

    Published 2017
    “…In order to achieve the less test generation complexity, design-for-testability (DFT) techniques are used which causes untestable paths to be testable. …”
    Get full text
    Get full text
    Article
  15. 15

    Adaptive rapidly-exploring-random-tree-star (Rrt*) -Smart: algorithm characteristics and behavior analysis in complex environments by Jauwairia Nasir, Fahad Islam, Yasar Ayaz

    Published 2013
    “…Rapidly Exploring Random Trees (RRT) are regarded as one of the most efficient tools for planning feasible paths for mobile robots in complex obstacle cluttered environments. …”
    Get full text
    Get full text
    Get full text
    Article
  16. 16

    Development of low power viterbi decoder on complex programmable logic device platform by Abu, Mohd Azlan

    Published 2018
    “…Consequently, the number of logic gates and the total power consumption of the STTC Viterbi decoder can be reduced by using the new algorithms. The proposed algorithms have been designed and implemented by using MATLAB, Altera Quartus 2 and Altera MAX V CPLD board. …”
    Get full text
    Get full text
    Get full text
    Thesis
  17. 17

    Simulation of shortest path using a-star algorithm / Nurul Hani Nortaja by Nurul Hani , Nortaja

    Published 2004
    “…The steps to calculate a shortest path using A • algorithm is shown by using appropriate examples and related figures. …”
    Get full text
    Get full text
    Thesis
  18. 18

    Modeling of cardiovascular diseases (CVDs) and development of predictive heart risk score by Mirza Rizwan, Sajid

    Published 2021
    “…However, the conversion of a complex form of ML algorithms into a simple statistical model is the prime concern. …”
    Get full text
    Get full text
    Thesis
  19. 19
  20. 20

    Laser simulator: a novel search graph-based path planning approach by Ali, Mohammed A. H., Musa, Mailah

    Published 2018
    “…It is also used to recognize the real roundabout from a sequence of images during local path planning in the real-world system. …”
    Get full text
    Get full text
    Get full text
    Article