Search Results - (( basic sharing selection algorithm ) OR ( java implementation path algorithm ))

Search alternatives:

  • Showing 1 - 8 results of 8
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
    Backtracking search algorithm for optimal power dispatch in power system / Mostafa Modiri Delshad

    Backtracking search algorithm for optimal power dispatch in power system / Mostafa Modiri Delshad by Mostafa, Modiri Delshad

    Published 2016
    “…The goal is to determine the most optimal power sharing among the generating units in a power system. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  6. 6
    Hybridflood algorithms minimizing redundant messages and maximizing efficiency of search in unstructured P2P networks

    Hybridflood algorithms minimizing redundant messages and maximizing efficiency of search in unstructured P2P networks by Barjini, Hassan

    Published 2012
    “…The heterogeneity of peers in unstructured P2Ps introduces both challenges and opportunities when designing a P2P network. Flooding is a basic file search procedure in unstructured P2P file-sharing systems. …”
    Get full text
    Get full text
    Thesis
    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
    HybridFlood: minimizing the effects of redundant messages and maximizing search efficiency of unstructured peer-to-peer networks

    HybridFlood: minimizing the effects of redundant messages and maximizing search efficiency of unstructured peer-to-peer networks by Barjini, Hassan, Othman, Mohamed, Ibrahim, Hamidah, Udzir, Nur Izura

    Published 2014
    “…A major portion of Internet traffic belongs to such applications. Flooding search is a basic search scheme for unstructured peer-to-peer networks, where a node must send a query message to all its neighbors when seeking a file (in a file sharing situation). …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: