Search Results - (( basic equation modified algorithm ) OR ( java implementation path algorithm ))

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

    Fuzzy algorithm for 3D coastal gemorphology mapping by DInSAR by Marghany, Maged, Hashim, Mazlan

    Published 2007
    “…Then fuzzy B-spline algorithm for 3D object reconstruction was modified based on the phase equation modified by weighted least square method to ensure 3 D coastal geomorphology reconstruction. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  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

    Memoryless modified symmetric rank-one method for large-scale unconstrained optimization by Modarres, Farzin, Abu Hassan, Malik, Leong, Wah June

    Published 2009
    “…Approach: The basic idea is to apply the modified Quasi-Newton (QN)equations, which uses both the gradients and the function values in two successive points in the frame of the scaled memoryless SR1 update, in which the modified SR1 update is reset, at every iteration, to the positive multiple of the identity matrix. …”
    Get full text
    Get full text
    Get full text
    Article
  7. 7

    Implementation of UPFC model into fast decoupled load flow by Mokhlis, Hazlie, Nor, K.M.

    Published 2004
    “…By using this approach, the basic Fast decoupled algorithm can be added with functionality to analyze UPFC without the need to modify the whole algorithm, which will require minimum modification. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  8. 8

    Power System State Estimation In Large-Scale Networks by NURSYARIZAL MOHD NOR, NURSYARIZAL

    Published 2010
    “…The gain and the Jacobian matrices associated with the basic algorithm require large storage and have to be evaluated at every iteration, resulting in more computation time. …”
    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