Search Results - (( java implementation path algorithm ) OR ( problem implementation some 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

    Quantum Processing Framework And Hybrid Algorithms For Routing Problems by Soltan Aghaei, Mohammad Reza

    Published 2010
    “…These quantum algorithms can be applied to solve routing problem in the quantum networks and the quantum multicomputer. …”
    Get full text
    Get full text
    Thesis
  7. 7

    A hybrid algorithm for finding shortest path in network routing. by Soltan Aghaei, Mohammad Reza, Ahmad Zulkarnain, Zuriati, Mamat, Ali, Zainuddin, Hishamuddin

    Published 2009
    “…This wave gives an O( N ) steps quantum algorithm for identifying that record, where was used classical Dijkstra’s algorithm for finding shortest path problem in the graph of network and implement quantum search. …”
    Get full text
    Article
  8. 8

    Sequential and parallel multiple tabu search algorithm for multiobjective urban transit scheduling problems by Uvaraja, Vikneswary

    Published 2018
    “…The multiobjective set covering model is used by including some real-world restrictions to find number of buses and drivers as it can represent the problem clearly for implementation. …”
    Get full text
    Get full text
    Thesis
  9. 9
  10. 10

    A hybrid algorithm based on artificial bee colony and artificial rabbits optimization for solving economic dispatch problem by Lee, Wei Wen, Hashim, Mohd Ruzaini

    Published 2023
    “…Despite these advantages, the basic ABC algorithm has some drawbacks such as slow convergence, poor exploitation, and difficulty in finding the best solution among all feasible solutions in some cases. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  11. 11

    Conjunctions in biological neural architectures for visual pose estimation / Tom´As Maul by Tom´As, Maul

    Published 2006
    “…As each level is traversed, a biological plausibility argument is gradually strengthened. At the algorithmic level, several approaches for solving the pose estimation problem are compared in terms of their neural implementability. …”
    Get full text
    Get full text
    Thesis
  12. 12

    Comparison of Some Numerical Methods for Solving Real-Life Nonlinear Equations by Using Python Programming / Annie Gorgey ... [et al.] by Gorgey, Annie, Zulkifly, Zul Hafiezy, Hassim, Haslinah, Azim, Farah Adilla

    Published 2024
    “…The accuracy of these methods is tested numerically on some real-life nonlinear equations such as the fluid permeability problem, the blood rheology model, Van Der Wall’s and Planck’s radiation laws, and lastly, the beam design problem. …”
    Get full text
    Get full text
    Get full text
    Article
  13. 13

    Three-term backpropagation algorithm for classification problem by Saman, Fadhlina Izzah

    Published 2006
    “…Despite the general success of this algorithm, there are several drawbacks and limitations which some of them are the existence of local minima, slow rates of convergence and some of the modification of BP algorithm requires complex and costly calculations at each iteration, which offset their faster rates of convergence. …”
    Get full text
    Get full text
    Thesis
  14. 14

    Attribute related methods for improvement of ID3 Algorithm in classification of data: A review by Nur Farahaina, Idris, Mohd Arfian, Ismail

    Published 2020
    “…Decision tree is an important method in data mining to solve the classification problems. There are several learning algorithms to implement the decision tree but the most commonly-used is ID3 algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
  15. 15

    Enhanced Clustering Algorithms For Gray-Scale Image Segmentation by Siddiqui, Fasahat Ullah

    Published 2012
    “…However, in some cases the conventional clustering algorithms introduce over-segmentation problems and unable to preserve the region of interest (i.e. objects).…”
    Get full text
    Get full text
    Thesis
  16. 16

    Implementation of an autonomous mobile robot navigation algorithm using C language by Subra Mullisi, Shafeq Marwan

    Published 2009
    “…The objective of the project is to develop navigation algorithm for the autonomous mobile robot. After that, implement the navigation algorithm on the mobile robot and without using the external sensor for navigation of the mobile robot to reach the specified point. …”
    Get full text
    Get full text
    Final Year Project
  17. 17

    Simulation of shortest path using a-star algorithm / Nurul Hani Nortaja by Nurul Hani , Nortaja

    Published 2004
    “…Nonetheless, the A • algorithm do have some unique properties which is more efficient in finding the shortest path especially in human real-world problem. …”
    Get full text
    Get full text
    Thesis
  18. 18

    A quantum algorithm for minimal spanning tree by Aghaei, Mohammad Reza Soltan, Ahmad Zukarnain, Zuriati, Mamat, Ali, Zainuddin, Hishamuddin

    Published 2008
    “…Classical algorithms involve searching over some space for finding the minimal spanning tree problem in a graph. …”
    Get full text
    Get full text
    Conference or Workshop Item
  19. 19

    Optimal Overcurrent Relays Coordination using an Improved Grey Wolf Optimizer by Noor Zaihah, Jamal, Mohd Herwan, Sulaiman, Omar, Aliman, Zuriani, Mustaffa

    Published 2018
    “…Recently, nature inspired algorithms (NIA) have been implemented to various fields of optimization problems. …”
    Get full text
    Get full text
    Get full text
    Article
  20. 20