Search Results - (( java implementation path algorithm ) OR ( using time study algorithm ))

Search alternatives:

Refine Results
  1. 1
    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:
  2. 2
    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
    “…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:
  3. 3
    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:
  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
    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
    “…The recent trend of software development uses OO paradigm. 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:
  6. 6
    Evaluation of outlier filtering algorithms for accurate measurement of travel time reliability incorporating lane-splitting situations / Obada M. A. Asqool

    Evaluation of outlier filtering algorithms for accurate measurement of travel time reliability incorporating lane-splitting situations / Obada M. A. Asqool by Obada , M. A. Asqool

    Published 2022
    “…This study used travel time datasets collected from three routes in Kuala Lumpur via Wi-Fi detectors during May 2018. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  7. 7
    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:
  8. 8
    Multi-queue CPU Process Prioritization using a Dynamic Quantum Time Algorithm Compared with Varying Time Quantum and Round-Robin Algorithms

    Multi-queue CPU Process Prioritization using a Dynamic Quantum Time Algorithm Compared with Varying Time Quantum and Round-Robin Algorithms by Mohammed, Maysoon A., Mazlina, Abdul Majid, Balsam, A. Mustafa

    Published 2016
    “…The algorithm uses multi queues with different quantum times for the processes. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  9. 9
    Analysis of Dijkstra’s and A* algorithm to find the shortest path

    Analysis of Dijkstra’s and A* algorithm to find the shortest path by Alija, Amani Saleh

    Published 2015
    “…In this study, two algorithms will be focused on. This study compares the Dijkstra’s, and A* algorithm to estimate search time and distance of algorithms to find the shortest path. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  10. 10
    Priority and dynamic quantum time algorithms for central processing unit scheduling

    Priority and dynamic quantum time algorithms for central processing unit scheduling by Mohammed, Maysoon A.

    Published 2018
    “…The proposed algorithms (Priority Dynamic Quantum Time and Multi Priority Dynamic Quantum Time Algorithms) are implemented using JAVA programming language and validated using Key Performance Indicators equations. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  11. 11
    Improved rsync algorithm to minimize communication cost using multi-agent systems for synchronization in multi-learning management systems

    Improved rsync algorithm to minimize communication cost using multi-agent systems for synchronization in multi-learning management systems by Mwinyi, Amir Kombo

    Published 2017
    “…Therefore, the aim of this study is to minimize the computation time during RFS by improving the standard rsync algorithm. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  12. 12
    Optimized crossover genetic algorithm for vehicle routing problem with time windows

    Optimized crossover genetic algorithm for vehicle routing problem with time windows by Nazif, Habibeh, Lee, Lai Soon

    Published 2010
    “…Conclusion/Recommendations: This study presented a genetic algorithm for solving vehicle routing problem with time windows using an optimized crossover operator. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  13. 13
    An alternative approach to normal parameter reduction algorithms for decision making using a soft set theory / Sani Danjuma

    An alternative approach to normal parameter reduction algorithms for decision making using a soft set theory / Sani Danjuma by Sani , Danjuma

    Published 2017
    “…However, they require much time to repeatedly run the algorithms to reduce unnecessary parameters using either parameter important degree or oriented parameter sum. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  14. 14
    Interactive jigsaw puzzle using backtracking algorithm / Amizah Mohd Kamaruzaman

    Interactive jigsaw puzzle using backtracking algorithm / Amizah Mohd Kamaruzaman by Mohd Kamaruzaman, Amizah

    Published 2012
    “…Based on the initial study, the Backtracking algorithm has been chosen as the most suitable algorithm to be used to develop the jigsaw puzzle according to available time and complexity of the algorithm. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  15. 15
    Minimization of traveling time for courier services using Floyd-Warshall algorithm (case study in Seremban 3) / Nur Haifa Nadhira Mohd Hisham, Norfatehah Hairuddin and Wan Nur Amira Natasya Wan Anuar

    Minimization of traveling time for courier services using Floyd-Warshall algorithm (case study in Seremban 3) / Nur Haifa Nadhira Mohd Hisham, Norfatehah Hairuddin and Wan Nur Amira Natasya Wan Anuar by Mohd Hisham, Nur Haifa Nadhira, Hairuddin, Norfatehah, Wan Anuar, Wan Nur Amira Natasya

    Published 2023
    “…This study focused on Floyd-Warshall algorithm in finding the shortest path to deliver the consignment with the least travel time. …”
    Get full text
    Get full text
    Student Project
    Save to List
    Saved in:
  16. 16
    River Suspended Sediment Prediction Using Various Multilayer Perceptron Neural Network Training Algorithms—A Case Study in Malaysia

    River Suspended Sediment Prediction Using Various Multilayer Perceptron Neural Network Training Algorithms—A Case Study in Malaysia by Mustafa, M.R., Rezaur, R.B., Saiedi, Saied, Isa, M.H.

    Published 2012
    “…Different statistical measures, time of convergence and number of epochs to reach the required accuracy were used to evaluate the performance of training algorithms. …”
    Get full text
    Get full text
    Citation Index Journal
    Save to List
    Saved in:
  17. 17
    CPU Burst Processes Prioritization Using Priority Dynamic Quantum Time Algorithm: A Comparison with Varying Time Quantum and Round Robin Algorithms

    CPU Burst Processes Prioritization Using Priority Dynamic Quantum Time Algorithm: A Comparison with Varying Time Quantum and Round Robin Algorithms by Mohammed, Maysoon A., Mazlina, Abdul Majid, Balsam, A. Mustafa, Ghani, Rana Fareed

    Published 2015
    “…In this study, we propose a priority algorithm with dynamic quantum time (PDQT), to improve the work of RR by improving the concept of Improved Round Robin with varying time quantum (IRRVQ). …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  18. 18
    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD

    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD by ABDULLAH, H., LAW BOON HUI, C., ZAKARIA, M. S.

    Published 2023
    “…Then, the results of machining time that used the tool path generated by the Ant Colony algorithm method was compared with the machining time that used tool paths generated by conventional methods. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  19. 19
    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD

    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD by ABDULLAH, H., LAW BOON HUI, C., ZAKARIA, M. S.

    Published 2023
    “…Then, the results of machining time that used the tool path generated by the Ant Colony algorithm method was compared with the machining time that used tool paths generated by conventional methods. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  20. 20
    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD

    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD by ABDULLAH, H., LAW BOON HUI, C., ZAKARIA, M. S.

    Published 2023
    “…Then, the results of machining time that used the tool path generated by the Ant Colony algorithm method was compared with the machining time that used tool paths generated by conventional methods. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: