Search Results - (( problem implementation search algorithm ) OR ( java implementation path algorithm ))

Search alternatives:

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
    Harmony search for multi-depot vehicle routing problem

    Harmony search for multi-depot vehicle routing problem by Misni, F., Lee, L. S.

    Published 2019
    “…We proposed an improved harmony search algorithm for solving this problem. Firstly, the Clarke & Wright saving algorithm is used for the initialisation of a solution vector in harmony search. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  5. 5
    An enumerative algorithm for the maximum clique problem

    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
    Save to List
    Saved in:
  6. 6
    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:
  7. 7
    Comparative analysis of line search methods in the Steepest Descent algorithm for unconstrained optimization problems / Ahmad Zikri Shukeri, Puteri Qurratu Ain Megat Sulzamzamendi and Suhaida Ibrahim

    Comparative analysis of line search methods in the Steepest Descent algorithm for unconstrained optimization problems / Ahmad Zikri Shukeri, Puteri Qurratu Ain Megat Sulzamzamendi... by Shukeri, Ahmad Zikri, Megat Sulzamzamendi, Puteri Qurratu Ain, Ibrahim, Suhaida

    Published 2024
    “…This study focuses on "Comparative Analysis of Line Search Methods in SD Algorithm for Unconstrained Optimization Problems". …”
    Get full text
    Get full text
    Student Project
    Save to List
    Saved in:
  8. 8
    Synthesis of transistor-chaining algorithm for CMOS cell layout using bipartite graph / Azizi Misnan

    Synthesis of transistor-chaining algorithm for CMOS cell layout using bipartite graph / Azizi Misnan by Misnan, Azizi

    Published 1997
    “…A depth - first search algorithm is used to search for optimal chaining. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  9. 9
    Simulation of shortest path using a-star algorithm / Nurul Hani Nortaja

    Simulation of shortest path using a-star algorithm / Nurul Hani Nortaja by Nurul Hani , Nortaja

    Published 2004
    “…For most of the cases of the shortest route finding, the Dijkstra's algorithm is known to be an optimal search algorithm. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  10. 10
    A quantum algorithm for minimal spanning tree

    A quantum algorithm for minimal spanning tree by Aghaei, Mohammad Reza Soltan, Ahmad Zukarnain, Zuriati, Mamat, Ali, Zainuddin, Hishamuddin

    Published 2008
    “…Classical algorithms involve searching over some space for finding the minimal spanning tree problem in a graph. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  11. 11
    An improved bees algorithm local search mechanism for numerical dataset

    An improved bees algorithm local search mechanism for numerical dataset by Al-Dawoodi, Aras Ghazi Mohammed

    Published 2015
    “…This algorithm performs a kind of exploitative neighbourhoods search combined with random explorative search. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  12. 12
    A hybrid algorithm for finding shortest path in network routing.

    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
    Save to List
    Saved in:
  13. 13
    Using artificial intelligence search in solving the camera placement problem

    Using artificial intelligence search in solving the camera placement problem by Altahir, A.A., Asirvadam, V.S., Hamid, N.H.B., Sebastian, P.

    Published 2022
    “…The various searching algorithms are implemented to seek the maximum coverage of the camera array. …”
    Get full text
    Get full text
    Book
    Save to List
    Saved in:
  14. 14
    Efficient task scheduling strategies using symbiotic organisms search algorithm for cloud computing environment

    Efficient task scheduling strategies using symbiotic organisms search algorithm for cloud computing environment by Sa'ad, Suleiman

    Published 2022
    “…Task scheduling in the cloud environment is an NP-Complete problem, because of its dynamism and huge search space given by problem instances that are large scale. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  15. 15
    A conceptual model for the E-commerce application recommendation framework using exploratory search

    A conceptual model for the E-commerce application recommendation framework using exploratory search by Mohammed Mahmudur Rahman, Zulkifly Mohd Zaki, Md. Monirul Islam, Najwa Hayaati Mohd Alwi

    Published 2024
    journal::journal article
    Save to List
    Saved in:
  16. 16
    Chaotic Immune Symbiotic Organisms Search algorithm for solving optimisation problem

    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
    Save to List
    Saved in:
  17. 17
    Hybrid of firefly algorithm and pattern search for solving optimization problems

    Hybrid of firefly algorithm and pattern search for solving optimization problems by Wahid, Fazli, Ghazali, Rozaida

    Published 2018
    “…Firefly algorithm (FA) is a newly introduced meta-heuristic, nature-inspired, stochastic algorithm for solving various types of optimization problems. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  18. 18
    Evaluation of the effectiveness and efficiency of Wagner and Fischer algorithm in retrieving Hadith translated documents / Kamarul Arifin Muhamad

    Evaluation of the effectiveness and efficiency of Wagner and Fischer algorithm in retrieving Hadith translated documents / Kamarul Arifin Muhamad by Muhamad, Kamarul Arifin

    Published 2002
    “…This thesis studies the method of a string-searching algorithm. The studies describe features and methods for string searching and comparison using Wagner and Fischer algorithm. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  19. 19
    Multi-state PSO GSA for solving discrete combinatorial optimization problems

    Multi-state PSO GSA for solving discrete combinatorial optimization problems by Ismail, Ibrahim

    Published 2016
    “…The multistate model is then implemented in PSO and GSA. As a consequence, multi-state particle swarm optimization (MSPSO) and multi-state gravitational search algorithm (MSGSA) are developed. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  20. 20
    Sequential and parallel multiple tabu search algorithm for multiobjective urban transit scheduling problems

    Sequential and parallel multiple tabu search algorithm for multiobjective urban transit scheduling problems by Uvaraja, Vikneswary

    Published 2018
    “…This thesis studies multiobjective UTSP consisting of frequency setting, timetabling, simultaneous bus and driver scheduling by applying Multiple Tabu Search (MTS) algorithm. Metaheuristic methods have been widely applied to solve UTSP which is a NP-hard problem. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:

Search Tools: