Search Results - (( java implementation path algorithm ) OR ( pattern selection drops 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
    Land Use Changes in Jeli, Kelantan

    Land Use Changes in Jeli, Kelantan by Muhammad Firdaus Abdul Karim

    Published 2013
    “…Land use change percentage and urban land expansion index (SI) are selected algorithm in this study. The overall accuracy assessment ranged from 61.39% to 92.05% which is moderate to accurate. …”
    Get full text
    Undergraduate Final Project Report
    Save to List
    Saved in:
  6. 6
    A scene invariant convolutional neural network for visual crowd counting using fast-lane and sample selective methods

    A scene invariant convolutional neural network for visual crowd counting using fast-lane and sample selective methods by Teoh, Shen Khang

    Published 2023
    “…Fast lane connection and sample selective algorithms have been designed specifically to tackle the issue of vanishing gradient and enhance the quality of the model. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / 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
    An integrated priority-based cell attenuation model for dynamic cell sizing

    An integrated priority-based cell attenuation model for dynamic cell sizing by Amphawan, Angela, Omar, Mohd Nizam, Din, Roshidi

    Published 2012
    “…Real-time predicted mobile traffic from the EFuNN structure was used to control the size of all the cells.Results obtained demonstrate the robustness of the integrated module in recognizing the temporal pattern of the mobile traffic and dynamically controlling the cell size in order to reduce the number of calls dropped.…”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  9. 9
    Optimal placement and sizing of distributed generation in radial distribution networks using particle swarm optimization and forward backward sweep method

    Optimal placement and sizing of distributed generation in radial distribution networks using particle swarm optimization and forward backward sweep method by Lawal, Sani Mohammed

    Published 2012
    “…PSO is among the meta-heuristics search methods like Genetic Algorithm (GA) but has been found to be computationally efficient, because it uses less number of functions for evaluation compared to GA that has genetic operators (Selection, crossover and mutation) and also the computational effort (time) required by PSO to arrive at high quality solutions is less than the effort required to the same high quality solutions by other heuristic search methods. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:

Search Tools: