Search Results - (( developing computer system algorithm ) OR ( java implementation path algorithm ))

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

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

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

    Parallel Processing of RSAAlgorithm Using MPI Library by Wan Dagang, Wan Rahaya

    Published 2006
    “…The system is needed to be parallel as to overcome the problem of intensive computational by the RSA algorithm. …”
    Get full text
    Get full text
    Final Year Project
  8. 8

    Sizing optimization of large-scale grid connected photovoltaic system using dolphin echolocation algorithm / Muhammad Zakyizzuddin Rosselan by Rosselan, Muhammad Zakyizzuddin

    Published 2018
    “…Before incorporating the optimization methods, a sizing algorithm for large-scale GCPV systems was developed. …”
    Get full text
    Get full text
    Thesis
  9. 9
  10. 10
  11. 11

    Extended development of a Computer Aided Detection (CAD) system for brain bleed in CT / Muhammad Illyas Abdul Muhji by Muhammad Illyas, Abdul Muhji

    Published 2018
    “…Previous study by Leong show the useful of CAD system but her study is not fully automated. Thus the main objective of this study is to implement an automatic algorithm to previous algorithm to make it fully automatic system. …”
    Get full text
    Get full text
    Thesis
  12. 12
  13. 13
  14. 14

    Ant colony optimization algorithm for dynamic scheduling of jobs in computational grid by Ku-Mahamud, Ku Ruhana, Ramli, Razamin, Yusof, Yuhanis, Mohamed Din, Aniza, Mahmuddin, Massudi

    Published 2012
    “…Job scheduling problem is classified as an NP-hard problem.Such a problem can be solved only by using approximate algorithms such as heuristic and meta-heuristic algorithms.Among different optimization algorithms for job scheduling, ant colony system algorithm is a popular meta-heuristic algorithm which has the ability to solve different types of NP-hard problems.However, ant colony system algorithm has a deficiency in its heuristic function which affects the algorithm behavior in terms of finding the shortest connection between edges.This research focuses on a new heuristic function where information about recent ants’ discoveries has been considered.The new heuristic function has been integrated into the classical ant colony system algorithm.Furthermore, the enhanced algorithm has been implemented to solve the travelling salesman problem as well as in scheduling of jobs in computational grid.A simulator with dynamic environment feature to mimic real life application has been development to validate the proposed enhanced ant colony system algorithm. …”
    Get full text
    Get full text
    Monograph
  15. 15
  16. 16
  17. 17

    Assignation of PSM evaluator using genetic algorithm by Yap, Suet Lee

    Published 2012
    “…The purpose of this paper is to present a design of development for Assignation of PSM Evaluator using Genetic Algorithm(APEGA)system.This is an application system that is used to assist the Faculty of Computer System and Software Engineering(FSKKP)of University Malaysia Pahang(UMP)in matching the optimum evaluators for the students in PSM presentation carnival.In the methodology part,a development model which involves with client participation is designed in order to use in the development of this project.The target user of the system is PSM coordinator who is responsible in assigning the PSM evaluator.Assignation of PSM Evaluator using Genetic Algorithm APEGA)is expected to be able in developing a well-distributed matching and overcoming the relevant constraints in an intelligent way. …”
    Get full text
    Get full text
    Undergraduates Project Papers
  18. 18
  19. 19
  20. 20