Search Results - (( problem application testing algorithm ) OR ( java implementation path algorithm ))

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

    Bats echolocation-inspired algorithms for global optimisation problems by Nafrizuan, Mat Yahya

    Published 2016
    “…The superior performances of the developed bats echolocation-inspired algorithms are verified through rigorous tests with optimisation benchmark test functions and problems. …”
    Get full text
    Get full text
    Thesis
  7. 7
  8. 8
  9. 9
  10. 10

    An experimental study of neighbourhood based metaheuristic algorithms for test case generation satisfying the modified condition / decision coverage criterion by Haque, Ariful

    Published 2018
    “…The elaborated result of the study will help test engineers to choose the algorithm they need to generate test cases efficiently and optimally.…”
    Get full text
    Get full text
    Thesis
  11. 11

    Multi-objective spiral dynamic algorithms-based for a better accuracy and diversity by Ahmad Azwan, Abdul Razak

    Published 2019
    “…On the other hand, multi-objective algorithm is applicable to solve a problem with two or more objectives. …”
    Get full text
    Get full text
    Thesis
  12. 12
  13. 13

    Parallel genetic algorithms for shortest path routing in high- performance computing / Mohd Erman Safawie Che Ibrahim by Che Ibrahim, Mohd Erman Safawie

    Published 2012
    “…This project has the capability to reduce the execution time of application problem using parallel algorithms to increase efficiency of cluster computing. …”
    Get full text
    Get full text
    Thesis
  14. 14
  15. 15

    Levy tunicate swarm algorithm for solving numerical and real-world optimization problems by J. J., Jui, M. A., Ahmad, M. I. M., Rashid

    Published 2022
    “…The proposed Levy Tunicate Swarm Algorithm (LTSA) is a novel metaheuristic algorithm that integrates the Levy distribution into a new metaheuristic algorithm called Tunicate Swarm Algorithm (TSA) to solve numerical and real-world optimization problems. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  16. 16
  17. 17
  18. 18

    The Evolutionary Convergent Algorithm: A Guiding Path of Neural Network Advancement by Hosseini E., Al-Ghaili A.M., Kadir D.H., Daneshfar F., Gunasekaran S.S., Deveci M.

    Published 2025
    “…In the past few decades, there have been multiple algorithms proposed for the purpose of solving optimization problems including Machine Learning (ML) applications. …”
    Article
  19. 19

    Modifying maximum likelihood test for solving singularity and outlier problems in high dimensional cases by Hafeez, Ahmad

    Published 2021
    “…However, the performance of the classical location and scatter estimators is usually flawed by singularity and outliers’ problems in high dimensional data sets. The study aimed to modify the existing ML test by incorporating the Cholesky banded regularization methods and thresholding sample covariance matrix to resolve singularity problems and incorporating the L₁-median with Weiszfeld’s algorithm (MLw) covariance matrix to solve outliers’ problem in high dimensional data sets. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  20. 20