Search Results - (( java implementation path algorithm ) OR ( program problem research algorithm ))

Refine Results
  1. 1

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

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

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

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

    Comparison Between Linear Programming And Integer Linear Programming: A Review by Sam, Mei Lee, Saptari, Adi, Salleh, Mohd Rizal, Mohamad, Effendi

    Published 2018
    “…This research discusses comparison of linear programming (LP) and integer linear programming (ILP). …”
    Get full text
    Get full text
    Get full text
    Article
  7. 7

    Development of dynamic programming algorithm for maintenance scheduling problem by Zafira Adlia, Mohd Fauzi

    Published 2020
    “…The objectives of this research are to develop a dynamic programming algorithm for the maintenance scheduling problem that can deal with the uncertainty and to determine the optimum maintenance schedule that will change according to the uncertainty that happened. …”
    Get full text
    Get full text
    Thesis
  8. 8

    Optimize class time tabling by using genetic algorithm technique in UTHM by Ahmad, Izah Rafidah

    Published 2019
    “…This research used genetic algorithm (GA) that was applied to java programming languages with a goal of reducing conflict and optimizing the fitness. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  9. 9
  10. 10

    Enhancement of Ant System Algorithm for Course Timetabling Problem by Djamarus, Djasli

    Published 2009
    “…In order to develop a new algorithm for the course scheduling problem, this research follows the experimental research methodology that consist of problem analysis, designing algorithm, implementing algorithm as a computer program in order to examine the results, analyzing the results, and if necessary improving the algorithm by doing all those activities over and over again. …”
    Get full text
    Get full text
    Get full text
    Thesis
  11. 11
  12. 12

    String matching algorithms: to search and compare longest common subsequence strings retrieved from Wagner & Fischer and Hirschberg algorithms on Malay dictionary words / Mohd Razi... by Mohd Ghazi, Mohd Razif

    Published 1999
    “…These methods were chosen because they are based on dynamic programming. Dynamic programming is used to solve both the String Distance Problem and Longest Common Subsequence (LCS) problem. …”
    Get full text
    Get full text
    Thesis
  13. 13

    A Modified Giffler and Thompson Genetic Algorithm on the Job Shop Scheduling Problem by Lee, Hui Peng, Salim, Sutinah

    Published 2006
    “…This algorithm is modified to produce better results than the existing algorithm by using Visual Prolog programming language.…”
    Get full text
    Get full text
    Get full text
    Article
  14. 14

    Agent-based extraction algorithm for computational problem solving by Rajabi, Maryam

    Published 2015
    “…Modeling Computational Problem Solving (CPS) is the main issue in teaching programming where the given text is needed to be transformed into a model then later into a programming language. …”
    Get full text
    Get full text
    Thesis
  15. 15

    An alternative method to solve combined economic emission dispatch problems using flower pollination algorithm by Hong, Mee Song

    Published 2016
    “…CEED actually is a multi-objective problem and need complex programming to solve it. …”
    Get full text
    Get full text
    Thesis
  16. 16
  17. 17
  18. 18
  19. 19
  20. 20

    Genetic Algorithm for vehicle routing problem / W.Nurfahizul Ifwah W.Alias, Mohd Shaiful Sharipudin and Shamsunarnie Mohamed Zukri. by W.Alias, W.Nurfahizul Ifwah, Sharipudin, Mohd Shaiful, Mohamed Zukri, Shamsunarnie

    Published 2012
    “…The objective of this research is to present a heuristic method, called Genetic Algorithm (GA), to solve the VRP. …”
    Get full text
    Get full text
    Research Reports