Search Results - (( java implementation path algorithm ) OR ( framework implementation modified 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
  6. 6

    Manufacturing process planning optimisation in reconfigurable multiple parts flow lines by Ismail, Napsiah, Musharavati, Farayi, Hamouda, Abdel Magid Salem, Ramli, Abdul Rahman

    Published 2008
    “…Two modified genetic algorithms are devised and employed to provide the best approximate process planning solution. …”
    Get full text
    Get full text
    Get full text
    Article
  7. 7

    Process Planning Optimization In Reconfigurable Manufacturing Systems by Musharavati, Farayi

    Published 2008
    “…The five (5) AADTs include; a variant of the simulated annealing algorithm that implements heuristic knowledge at critical decision points, two (2) cooperative search schemes based on a “loose hybridization” of the Boltzmann Machine algorithm with (i) simulated annealing, and (ii) genetic algorithm search techniques, and two (2) modified genetic algorithms. …”
    Get full text
    Get full text
    Thesis
  8. 8
  9. 9

    Modified quasi-Newton type methods using gradient flow system for solving unconstrained optimization by Yap, Chui Ying

    Published 2016
    “…We also implement the Newton-type methods on trust region framework by using unit step length to adjust the radius of the region to obtain desired reduction in the objective function. …”
    Get full text
    Get full text
    Thesis
  10. 10

    Modelling Autonomous Evacuation Navigation System (AENS) for optimal route using Dijkstra's algorithm by Abu Samah, Khyrina Airin Fariza

    Published 2016
    “…Through ST adaptation, all subsystems were integrated and using the “Dijkstra’s algorithm” (DA) by modifying its function from shortest path algorithm to safest and shortest algorithm, to the nearest exit. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  11. 11
  12. 12

    Smart grid: Bio-inspired algorithms energy distributions for data centers by Woo, Yu Hang

    Published 2025
    “…The system is implemented and simulated using the CloudSim Plus framework under both homogeneous and heterogeneous data centre environments. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  13. 13

    Runtime pluggable CPU scheduler for linux operating system by Al-Maweri, Nasr Addin Ahmed Salem

    Published 2010
    “…It added more flexibility to the Linux CPU heduler. It has been implemented in three layers, kernel, modules, and user interface layer, to simplify the framework development and maintenance as well as to maintain performance. …”
    Get full text
    Get full text
    Thesis
  14. 14

    Review of the grey wolf optimization algorithm: variants and applications by Liu, Yunyun, As’arry, Azizan, Hassan, Mohd Khair, Hairuddin, Abdul Aziz

    Published 2023
    “…The paper begins with a concise introduction to the GWO, providing insight into its natural establishment and conceptual framework for optimization. It then lays out the theoretical foundation and key procedures involved in the GWO, following which it comprehensively examines the most recent iterations of the algorithm and categorizes them into parallel, modified, and hybridized variations. …”
    Get full text
    Get full text
    Article
  15. 15

    Comparative analysis of line search methods in the Steepest Descent algorithm for unconstrained optimization problems / Ahmad Zikri Shukeri, Puteri Qurratu Ain Megat Sulzamzamendi... by Shukeri, Ahmad Zikri, Megat Sulzamzamendi, Puteri Qurratu Ain, Ibrahim, Suhaida

    Published 2024
    “…The study's trajectory takes a subtle turn as it proposes a modified methodology that includes a detailed comparison investigation of several line search strategies inside the SD algorithm. …”
    Get full text
    Get full text
    Student Project
  16. 16

    Automated-tuned hyper-parameter deep neural network by using arithmetic optimization algorithm for Lorenz chaotic system by Nurnajmin Qasrina Ann, ., Pebrianti, Dwi, Mohammad Fadhil, Abas, Bayuaji, Luhur

    Published 2023
    “…Deep neural networks (DNNs) are very dependent on their parameterization and require experts to determine which method to implement and modify the hyper-parameters value. This study proposes an automated-tuned hyper-parameter for DNN using a metaheuristic optimization algorithm, arithmetic optimization algorithm (AOA). …”
    Get full text
    Get full text
    Get full text
    Article
  17. 17

    Local-based stereo matching algorithm using multi-cost pyramid fusion, hybrid random aggregation and hierarchical cluster-edge refinement by Kadmin, Ahmad Fauzan

    Published 2023
    “…Therefore, the proposed framework is proven to be competitive with other established methods and can be used as a complete algorithm.…”
    Get full text
    Get full text
    Get full text
    Thesis
  18. 18

    Automated-tuned hyper-parameter deep neural network by using arithmetic optimization algorithm for Lorenz chaotic system by Ayop Azmi, Nurnajmin Qasrina Ann, Pebrianti, Dwi, Abas, Mohammad Fadhil, Bayuaji, Luhur

    Published 2023
    “…Deep neural networks (DNNs) are very dependent on their parameterization and require experts to determine which method to implement and modify the hyper-parameters value. This study proposes an automated-tuned hyper�parameter for DNN using a metaheuristic optimization algorithm, arithmetic optimization algorithm (AOA). …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  19. 19

    A Hybrid Rough Sets K-Means Vector Quantization Model For Neural Networks Based Arabic Speech Recognition by Babiker, Elsadig Ahmed Mohamed

    Published 2002
    “…A vector quantization model that incorporate rough sets attribute reduction and rules generation with a modified version of the K-means clustering algorithm was developed, implemented and tested as a part of a speech recognition framework, in which the Learning Vector Quantization (LVQ) neural network model was used in the pattern matching stage. …”
    Get full text
    Get full text
    Thesis
  20. 20

    Review of the grey wolf optimization algorithm: variants and applications by Liu, Yunyun, As’arry, Azizan, Hassan, Mohd Khair, Hairuddin, Abdul Aziz, Mohamad, Hesham

    Published 2024
    “…The paper begins with a concise introduction to the GWO, providing insight into its natural establishment and conceptual framework for optimization. It then lays out the theoretical foundation and key procedures involved in the GWO, following which it comprehensively examines the most recent iterations of the algorithm and categorizes them into parallel, modified, and hybridized variations. …”
    Get full text
    Get full text
    Article