Search Results - (( java implementation path algorithm ) OR ( basic case maximization 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
    On Clustering Algorithm Of Coverage Area Problems In Wireless Sensor Networks

    On Clustering Algorithm Of Coverage Area Problems In Wireless Sensor Networks by Ismail Abdullah, Kalid Abdlkader Marsal

    Published 2024
    “…In the case study, many algorithms have been proposed in the literature, in order to find the maximum number of disjoint or non-disjoint sets of sensor cover sets, we can see where one set can be active at any one time. …”
    Article
    Save to List
    Saved in:
  6. 6
    An analytical approach on parametric estimation of cure fraction based on weibull distribution using interval censored data.

    An analytical approach on parametric estimation of cure fraction based on weibull distribution using interval censored data. by I. Aljawadi , Bader Ahmad, Abu Bakar, Mohd Rizam, Ibrahim, Noor Akma

    Published 2011
    Get full text
    Get full text
    Get full text
    Article
    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
    Public healthcare facility planning in Malaysia : Using location allocation models / S. Sarifah Radiah Shariff

    Public healthcare facility planning in Malaysia : Using location allocation models / S. Sarifah Radiah Shariff by S. Sarifah Radiah, Shariff

    Published 2012
    “…This study attempts to develop some mathematical location-allocation models for the locations of the public health care facilities in Malaysia. Two basic location allocation models with two different objectives are studied: The p-median problem and the Maximal Covering Location Problem (MCLP). …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  9. 9
    An innovative approach of blending security features in energy-efficient routing for a crowded network of wireless sensors

    An innovative approach of blending security features in energy-efficient routing for a crowded network of wireless sensors by Pathan, Al-Sakib Khan, Ahmed, Tarem

    Published 2014
    “…Energy efficiency is also very necessary to maximize the lifetime of the network.…”
    Get full text
    Get full text
    Get full text
    Book Chapter
    Save to List
    Saved in:

Search Tools: