Search Results - (( java implementation path algorithm ) OR ( program print based algorithm ))

  • Showing 1 - 18 results of 18
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
  6. 6
  7. 7

    Studying course placements optimization problems in College of Business (COB) UUM by Idris, Siti Raziah, Abdul Rahim, Mohd Kamarul Irwan

    Published 2017
    “…This study involved 16 fundamental students at UUM at COB, selected as respondents.We have the accurate decision by using second quantitative method that called as AMPL.The programming of simple practical mathematical programming by using some algorithm in computer and printing for optimum solutions.This study aims to complete the placement of university students as an assignment problem by using mathematical programming method to solve the problem.The findings of the study will be used to increase knowledge on the issue of the appropriate placement courses for students and guidance to the university.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  8. 8
  9. 9
  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
  12. 12

    Development of an open-source and low-cost robotic arm based on STM32 microcontroller for promoting STEM education by Mohd Asri, Fatin Atirah, Ayob, Mohammad Afif, Rohaziat, Nurasyeera, Rahman, Hisyam Abdul, Rahman, Khairul Azlan A., Ayob, Mohd Erdi

    Published 2023
    “…This study aims to promote STEM education by describing the development of a free, open-source robot joint with three degrees of freedom (DOF). The control algorithm for a 3D-printed MK2 robot arm was programmed with an STM32 microcontroller. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  13. 13
  14. 14
  15. 15
  16. 16
  17. 17
  18. 18

    Bottleneck adjacent matching heuristics for scheduling a re-entrant flow shop with dominant machine problem by Sh Ahmad, Sh Salleh

    Published 2009
    “…As a general conclusion, this research has achieved the objectives to develop bottleneck-based makespan algorithms and heuristics applicable for re-entrant flow shop environment. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis