Search Results - (( java implementation path algorithm ) OR ( problem implementation _ 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
    “…Therefore, Heavy Transportation Shortest Route using Dijkstra’s Algorithm (HETRO) has been developed as solution due to the problems. …”
    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

    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
  6. 6

    The Implementation of Genetic Algorithm in Path Optimization by Jumali, Suriana

    Published 2005
    “…In this project, TSP will be used to model and easy visualize the path optimization problem and Genetic Algorithm (GA) was chosen to be implemented in resolving the problem. …”
    Get full text
    Get full text
    Final Year Project
  7. 7

    Quantum Processing Framework And Hybrid Algorithms For Routing Problems by Soltan Aghaei, Mohammad Reza

    Published 2010
    “…These quantum algorithms can be applied to solve routing problem in the quantum networks and the quantum multicomputer. …”
    Get full text
    Get full text
    Thesis
  8. 8

    Low-level hybridization scripting language with dynamic parameterization in PSO-GA / Suraya Masrom by Masrom, Suraya

    Published 2015
    “…However, in many cases, implementing the suitable hybrid algorithms for a given optimization problem is a considerably difficult, which in most cases, is time consuming. …”
    Get full text
    Get full text
    Thesis
  9. 9

    Festive season balancing groceries optimization / Fairuz Mohamed Razi by Mohamed Razi, Fairuz

    Published 2012
    “…An Artificial Intelligence method or technique is selected to provide a solution to this problem. The cause of the shortage in supply-demand is taken to be implemented in the Genetic Algorithms optimization concepts. …”
    Get full text
    Get full text
    Thesis
  10. 10

    Chaotic Immune Symbiotic Organisms Search algorithm for solving optimisation problem by Zamani M.K.M., Musirin I., Suliman S.I., Mustaffa S.A.S.

    Published 2023
    “…Good performance of these heuristics-based algorithm has been implied through various implementation in solving optimisation problems. …”
    Article
  11. 11

    Enhancing Market-Based Scheduling Algorithm on Globally Distributed Web Servers Using Least Suitable Sealed Bid Technique by Al-Ewiwi, Mahmoud

    Published 2006
    “…Scheduling of a multiple distributed servers is considered as a complex problem.considered as NP-complete problem,where no single efficient algorithm guaranteed to produce optimal results.This thesis investigates on how to find optimal solution for distribute system,by implementing market based scheduling Algorithm(MBSA).On implementing the MBSA, a new auction technique which is the least suitable sealed bid auction will be introduced.it is found that least suitable sealed bid technique will give the close-to-optimum solution.In the implementation, cooperative agents were used as a middleware between web servers and stand-alone schedulers. …”
    Get full text
    Get full text
    Thesis
  12. 12

    An experiment on the performance of shortest path algorithm by Chan, Simon Yew Meng, Adnan, Nur’ayuni, Sukri, Syazwan Syafiqah, Wan Zainon, Wan Mohd Nazmee

    Published 2016
    “…The main objective of this paper is to study and experiment the different shortest path algorithm such as Dijkstra’s algorithm, Symmetrical Dijkstra’s algorithm, A* algorithm, Bellman-Ford algorithm, Floyd-Warshall algorithm and Genetic algorithm in solving the shortest path problem. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  13. 13

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

    Published 2018
    “…We have chosen four neighborhood based algorithms which are commonly used in optimization problems and divided them in newly implemented and re-implemented category. …”
    Get full text
    Get full text
    Thesis
  14. 14

    Diagnosis of eyesight using Improved Clonal Selection Algorithm (ICLONALG) / Nor Khirda Masri by Masri, Nor Khirda

    Published 2017
    “…This study aims to implement the classification algorithm using the Improved Clonal Selection Algorithm (ICLONALG) to classify the eyesight’s problems. …”
    Get full text
    Get full text
    Thesis
  15. 15

    An enumerative algorithm for the maximum clique problem by Mustafa, Mamat, Suyudi, M., Sukono, ., Bon, A.T.

    Published 2019
    “…Partial enumerative algorithms are presented for maximum clique problems which are very easy to implement. …”
    Get full text
    Get full text
    Conference or Workshop Item
  16. 16

    A hybrid algorithm for finding shortest path in network routing. by Soltan Aghaei, Mohammad Reza, Ahmad Zulkarnain, Zuriati, Mamat, Ali, Zainuddin, Hishamuddin

    Published 2009
    “…This wave gives an O( N ) steps quantum algorithm for identifying that record, where was used classical Dijkstra’s algorithm for finding shortest path problem in the graph of network and implement quantum search. …”
    Get full text
    Article
  17. 17

    Parallel distributed genetic algorithm development based on microcontrollers framework by Krishnan P.S., Kiong T.S., Koh J.

    Published 2023
    “…This work is focused on the implementation of evolutionary based computer algorithms, genetic algorithms (GAs), on microcontrollers. …”
    Conference paper
  18. 18
  19. 19

    FPGA implementation of metaheuristic optimization algorithm by Nurul Hazlina, Noordin, Phuah, Soon Eu, Zuwairie, Ibrahim

    Published 2023
    “…Metaheuristic algorithms are gaining popularity amongst researchers due to their ability to solve nonlinear optimization problems as well as the ability to be adapted to solve a variety of problems. …”
    Get full text
    Get full text
    Get full text
    Article
  20. 20

    Metric's thresholds for encoding evolutionary computing representation in software engineering problem by Md Sultan, Abu Bakar, Din, Jamilah, Zulzalil, Hazura, Bakar, Abubakar Diwani

    Published 2015
    “…Algorithm was tested to metric selection problem using Genetic Algorithm and the results obtained are promising.…”
    Get full text
    Get full text
    Get full text
    Article