Search Results - (( java implementation path algorithm ) OR ( using carter using algorithm ))

  • Showing 1 - 12 results of 12
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

    Solving University Examination Timetabling Problem Using Intelligent Water Drops Algorithm by Aldeeb, BA, Norwawi, NM, Al-Betar, MA, Bin Jali, MZ

    Published 2024
    “…As an initial study, the IWD Algorithm is tailored to solve uncapacitated examination timetabling problem by using carter 1996 dataset and is able to produce acceptable results, though they were not better than the the results that already reported in the literature. …”
    Proceedings Paper
  6. 6

    Hybrid genetic algorithm for uncapacitated university examination timetabling problem by Ishak, Suhada

    Published 2015
    “…All proposed algorithms are coded in C using Microsoft Visual C++ 6.0 as the compiler. …”
    Get full text
    Get full text
    Thesis
  7. 7

    Hybrid genetic algorithm for university examination timetabling problem by Ishak, Suhada, Lee, Lai Soon, Ibragimov, Gafurjan

    Published 2016
    “…The performance of the proposed HGA is compared with other metaheuristics from literature using the Carter’s benchmark dataset which comprises of real-world timetabling problem from various universities. …”
    Get full text
    Get full text
    Get full text
    Article
  8. 8
  9. 9

    Enhanced Intelligent Water Drops Algorithm for University Examination Timetabling Problems by Bashar AbedAl Mohdi Talal AlDeeb

    Published 2024
    “…This thesis presents an investigation of using the Intelligent Water Drops (IWD) algorithm to construct and produce good quality solutions for the UETP. …”
    thesis::doctoral thesis
  10. 10

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

    A constructive approach to examination timetabling based on adaptive decomposition and ordering by Abdul Rahman, Syariza, Burke, Edmund K., Bargiela, Andrzej, McCollum, Barry, Özcan, Ender

    Published 2014
    “…Moreover, the examinations within each set are ordered using different strategies based on graph colouring heuristics.Initially, the examinations are placed into the easy set. …”
    Get full text
    Get full text
    Get full text
    Article
  12. 12

    Dynamic forecasting model for short series age-specific mortality / Wan Zakiyatussariroh Wan Husin by Wan Husin, Wan Zakiyatussariroh

    Published 2017
    “…In the second stage, three variants of LC models in state space framework (LC-SS model) were proposed using algorithm for a large number of series with a short time period. …”
    Get full text
    Get full text
    Thesis