Search Results - (( basic generation y algorithm ) OR ( java implementation path algorithm ))

  • Showing 1 - 12 results of 12
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

    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
  5. 5
  6. 6
  7. 7

    Integration of enchanced jump point search (JPS) algorithm with modified bresenham technique for path planning in virtual grid-based environment by Nurul Atikah Janis

    Published 2018
    “…The second approach is the modification of heuristic computation using original A* and modified Bresenham. Bresenham Line Algorithm is a line generation algorithm using integer arithmetic where the points (x1, y1) and (x2, y2) are assumed not equal and integer valued. …”
    Get full text
    Get full text
    Get full text
    Thesis
  8. 8

    Projected majorized-correlation technique for noise filtering and accuracy in orthogonal frequency division multiplexing by Alsaadi, Alaa Abdullah Mohammed

    Published 2020
    “…Precisely, by proposing the projected signal (py>) in PQMCC technique has solved the three main issues: power of noise, accuracy in received random signal (y>) and complexity in Tight Quadratic Majorization algorithm (TQM) for Phase Noise Estimation Technique. …”
    Get full text
    Get full text
    Thesis
  9. 9

    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
  10. 10
  11. 11
  12. 12