Search Results - (( java implementation path algorithm ) OR ( using minimum _ 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
    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
    Approximate maximum clique algorithm (AMCA): A clever technique for solving the maximum clique problem through near optimal algorithm for minimum vertex cover problem

    Approximate maximum clique algorithm (AMCA): A clever technique for solving the maximum clique problem through near optimal algorithm for minimum vertex cover problem by Fayaz, Muhammad, Arshad,, Shakeel, Shah,, Abdul Salam, Shah, Asadullah

    Published 2018
    “…The only way left is to use the approximation algorithm of Minimum Vertex Cover (MVC) for the solution of the Maximum Clique (MC) problem. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  6. 6
    Batch mode heuristic approaches for efficient task scheduling in grid computing system

    Batch mode heuristic approaches for efficient task scheduling in grid computing system by Maipan-Uku, Jamilu Yahaya

    Published 2016
    “…We simulate our proposed algorithms using a Java based simulator that is purposedly built for Grid computing simulations. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  7. 7
    Outlier detection in circular regression model using minimum spanning tree method

    Outlier detection in circular regression model using minimum spanning tree method by Nur Faraidah, Muhammad Di, Siti Zanariah, Satari, Roslinazairimah, Zakaria

    Published 2019
    “…Therefore, this study aims to develop new algorithms that can detect outliers by using the minimum spanning tree method. …”
    Get full text
    Get full text
    Conference or Workshop Item
    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
    “…The result will be compared with euler's path algorithm using heuristic search and a pseudo input to find the minimum interlace.…”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  9. 9
    Finding the shortest route using Dijkstra’s algorithm with application to ride hailing in UiTM Cawangan Negeri Sembilan Kampus Seremban / Nur Husnina Hassan, Nurin Hadrah Syahira Muhamad Bakri and Alya Batrisyia Sazeli

    Finding the shortest route using Dijkstra’s algorithm with application to ride hailing in UiTM Cawangan Negeri Sembilan Kampus Seremban / Nur Husnina Hassan, Nurin Hadrah Syahira M... by Hassan, Nur Husnina, Muhamad Bakri, Nurin Hadrah Syahira, Sazeli, Alya Batrisyia

    Published 2022
    “…Therefore, to find the shortest route with minimum time, Dijkstra's Algorithm will be used. Apart from that, the Dijkstra’s Algorithm used in this study will allow us to find the smallest weight path for all permanently labelled Nod once it has been run. …”
    Get full text
    Get full text
    Student Project
    Save to List
    Saved in:
  10. 10
    Hybrid Spatial-Artificial Intelligence Approach for Renewable Energy Sources Sites Identification and Integration in Sarawak State

    Hybrid Spatial-Artificial Intelligence Approach for Renewable Energy Sources Sites Identification and Integration in Sarawak State by Far Chen, Jong

    Published 2022
    “…In each case, the Traveling Salesman Problem-Genetic Algorithm (TSP-GA) algorithm is applied to determine a minimum total distance of RES sites integration. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  11. 11
    A novel algorithm to detect a QPSK signal with the minimum number of samples

    A novel algorithm to detect a QPSK signal with the minimum number of samples by Mohammed, Saleh, Hilmi, Sanusi, Abubakar, Adamu, Haruna, Chiroma, Edi, Sutoyo, Mungad, Mu, Tutut, Herawan

    Published 2015
    “…The algorithm was simulated and tested using ANSI C++. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Proceeding Paper
    Save to List
    Saved in:
  12. 12
    Finding minimum path by using Genetic Algorithm (GA)/ Siti Zuraifah Hashim

    Finding minimum path by using Genetic Algorithm (GA)/ Siti Zuraifah Hashim by Hashim, Siti Zuraifah

    Published 2007
    “…In this paper, GA has been applied to find the minimum path, then result will be compared with Dijkstra's algorithm are presented.…”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  13. 13
    A hybrid local search algorithm for minimum dominating set problems

    A hybrid local search algorithm for minimum dominating set problems by Abed, S.A., Rais, H.M., Watada, J., Sabar, N.R.

    Published 2022
    “…This algorithm focuses on generating promising solutions in different areas of the solution space using the problem search history. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  14. 14
    A hybrid local search algorithm for minimum dominating set problems

    A hybrid local search algorithm for minimum dominating set problems by Abed, S.A., Rais, H.M., Watada, J., Sabar, N.R.

    Published 2022
    “…This algorithm focuses on generating promising solutions in different areas of the solution space using the problem search history. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  15. 15
    A Genetic Algorithm Based Approach for Solving the Minimum Dominating Set of Queens Problem

    A Genetic Algorithm Based Approach for Solving the Minimum Dominating Set of Queens Problem by Alharbi, Saad, Venkat, Ibrahim

    Published 2017
    “…However, literature shows that limited research has been carried out to solve theMDSQP using bioinspired algorithms. To fill this gap, this paper proposes a simple and effective solution based on genetic algorithms to solve this classical problem. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  16. 16
    A Genetic Algorithm Based Approach for Solving the Minimum Dominating Set of Queens Problem

    A Genetic Algorithm Based Approach for Solving the Minimum Dominating Set of Queens Problem by Alharbi, Saad, Venkat, Ibrahim

    Published 2017
    “…However, literature shows that limited research has been carried out to solve theMDSQP using bioinspired algorithms. To fill this gap, this paper proposes a simple and effective solution based on genetic algorithms to solve this classical problem. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  17. 17
    Multi objective optimisation for high speed end milling using simulated annealing algorithm

    Multi objective optimisation for high speed end milling using simulated annealing algorithm by Al Hazza, Muataz Hazza Faizi, Adesta, Erry Yulian Triblas, Shaffiar, Norhashimah, Seder, Amin M. F., Riza, Muhammad

    Published 2015
    “…This paper presents the optimization of machining parameters in end milling processes by using the simulated annealing algorithm (SAA) as one of the unconventional methods in optimization. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  18. 18
    Firefly algorithm: Minimizing cost on single-level lot-sizing problem / Siti Hafawati Jamaluddin ... [et al.]

    Firefly algorithm: Minimizing cost on single-level lot-sizing problem / Siti Hafawati Jamaluddin ... [et al.] by Jamaluddin, Siti Hafawati, Zulkipli, Nurul Azleeka, Mahmud, Norwaziah, Muhamat Pazil, Nur Syuhada

    Published 2018
    “…From the problem emerge, the minimum of production cost is determined by using firefly algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  19. 19
    Some greedy based algorithms for multi periods degree constrained minimum spanning tree problem

    Some greedy based algorithms for multi periods degree constrained minimum spanning tree problem by Wamiliana, Wamiliana, Elfaki, Faiz Ahmed Mohamed, Usman, Mustofa, Azram, Mohammad

    Published 2015
    “…In this paper we proposed three algorithms by modifying Kruskal’s and Prim’s algorithms. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  20. 20
    Robot manipulator minimum jerk trajectory planning based on the improved dung Beetle Optimizer Algorithm

    Robot manipulator minimum jerk trajectory planning based on the improved dung Beetle Optimizer Algorithm by Ma, Haohao, As’arry, Azizan, Cong, Miaomiao, Delgoshaei, Aidin, Ismail, Mohd Idris Shah, Ramli, Hafiz Rashidi, Wu, Xuping

    Published 2024
    “…This paper discusses different algorithms and finally proposes a fusion of the improved Dung Beetle Optimizer (IDBO) algorithm using chaotic mapping, sinusoidal random mutation, and nonlinear convergence strategies with the bidirectional Rapidly exploring Random Tree (RRT) algorithm to achieve manipulator trajectory planning and minimum jerk optimization trajectory. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: