Search Results - (( based evaluation _ 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

    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

    Evolutionary cost-cognizant regression test case prioritization for object-oriented programs by Bello, AbdulKarim

    Published 2019
    “…Afterward evolutionary algorithm (EA) was employed to prioritize test cases based on the rate severity of fault detection per unit test cost. …”
    Get full text
    Get full text
    Thesis
  6. 6

    Sudoku Generator based on hybrid algorithm / Faridah Abdul Rahman by Abdul Rahman, Faridah

    Published 2012
    “…After testing and evaluation the prototype, the result shows that the Sudoku generator based on hybrid algorithm takes more times on solving the Sudoku. …”
    Get full text
    Get full text
    Thesis
  7. 7

    Performance Evaluation of Vector Evaluated Gravitational Search Algorithms Based on ZDT Test Functions by Badaruddin, Muhammad, Zuwairie, Ibrahim, Kamarul Hawari, Ghazali, Mohd Riduwan, Ghazali, Kian, Sheng Lim, Sophan Wahyudi, Nawawi, Nor Azlina, Ab. Aziz, Marizan, Mubin, Norrima, Mokhtar

    Published 2014
    “…This paper presents a performance evaluation of Vector Evaluated Gravitational Search Algorithm (VEGSA), namely VEGSA-I and VEGSA-II algorithms, for multi-objective optimization problems. …”
    Get full text
    Get full text
    Get full text
    Article
  8. 8

    Standardizing and weighting the evaluation criteria of many-objective optimization competition algorithms based on fuzzy delphi and fuzzy-weighted zero-inconsistency methods by Salih, Rawia Tahrir

    Published 2021
    “…The evaluation criteria of Many Objective Optimization algorithm (MaOO) play a critical role in evaluating the competition MaOO algorithms. …”
    Get full text
    Get full text
    Thesis
  9. 9

    Efficient genetic partitioning-around-medoid algorithm for clustering by Garib, Sarmad Makki Mohammed

    Published 2019
    “…However, the complexity of the kmedoid based algorithms in general is more than the complexity of the k-means based algorithms. …”
    Get full text
    Get full text
    Thesis
  10. 10
  11. 11

    Optimizing large scale combinatorial problems using multiple ant colonies algorithm based on pheromone evaluation technique by Aljanaby, Alaa, Ku-Mahamud, Ku Ruhana, Md Norwawi, Norita

    Published 2008
    “…The new algorithm is based on the ant colony system and utilizes average and maximum pheromone evaluation mechanisms. …”
    Get full text
    Get full text
    Get full text
    Article
  12. 12

    Objective and Subjective Evaluations of Adaptive Noise Cancellation Systems with Selectable Algorithms for Speech Intelligibility by Roshahliza, M. Ramli, Salina, Abdul Samad, Noor, Ali O. Abid

    Published 2018
    “…Adaptive Noise Cancellation (ANC) systems with selectable algorithms refer to ANC systems that are able to change the adaptation algorithm based on the eigenvalue spread of the noise. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  13. 13

    Efficient signaling schedule for centralized and distributed scheduling algorithms for wimax multi-hop relay networks by Saqer, Ahmad Sabri Mousa

    Published 2012
    “…On the other hand, the proposed distributed scheduling algorithm (MR-DSA) was evaluated by comparing its performance against performances of Greedy and the factor-graph-based low-complexity distributed scheduling algorithm (FGDS) algorithms in terms of delay, throughput, and overhead. …”
    Get full text
    Get full text
    Thesis
  14. 14
  15. 15

    Development of high quality speech compression system for Quranic recitation based on modified CELP algorithm by Gunawan, Teddy Surya, Kartiwi, Mira

    Published 2013
    “…Lastly, we evaluate the performance of the developed algorithm objectively using PESQ (Perceptual Evaluation of Speech Quality). …”
    Get full text
    Get full text
    Get full text
    Proceeding Paper
  16. 16

    An adaptive routing algorithm: enhanced confidence-based Q routing algorithm in network traffic by Yap, Soon Teck, Othman, Mohamed

    Published 2004
    “…Confidence-based Q (CQ) Routing Algorithm is an adaptive network routing algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
  17. 17

    Evaluation of Visual Network Algorithms on Historical Documents by Khairunnisa, Binti Ibrahim

    Published 2020
    “…The evaluation found that FA2 algorithm when combined with MC algorithm produce the best network representation for SAGA. …”
    Get full text
    Get full text
    Get full text
    Thesis
  18. 18

    Case Slicing Technique for Feature Selection by A. Shiba, Omar A.

    Published 2004
    “…This technique with k = 10 has been used in this thesis to evaluate the proposed approach. CST was compared to other selected classification methods based on feature subset selection such as Induction of Decision Tree Algorithm (ID3), Base Learning Algorithm K-Nearest Nighbour Algorithm (k-NN) and NaYve Bay~sA lgorithm (NB). …”
    Get full text
    Get full text
    Thesis
  19. 19
  20. 20

    Centre-based hard clustering algorithms for Y-STR data / Ali Seman, Zainab Abu Bakar and Azizian Mohd. Sapawi by Seman, Ali, Abu Bakar, Zainab, Mohd. Sapawi, Azizian

    Published 2010
    “…The k-Means and the k-Modes algorithms are the fundamental algorithms for the centroid-based partitioning technique, whereas the k-Medoids is a representative object-based partitioning technique. …”
    Get full text
    Get full text
    Get full text
    Article