Search Results - (( developing a replication 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

    A novel deadlock detection algorithm for neighbour replication on grid environment by Noriyani, Mohd Zin

    Published 2012
    “…Therefore, an action must be taken to detect and solve this problem. A new framework and algorithm called Neighbour Replication on Grid Deadlock Detection (NRGDD) has been developed to handle deadlock cycles that exist during the transaction in Neighbour Replication on Grid (NRG) environment. …”
    Get full text
    Get full text
    Thesis
  6. 6

    Managing Heterogeneous Database Replication Using Persistence Layer Synchronous Replication (PLSR) by Noraziah, Ahmad, Abdalla, Ahmed N., Beg, Abul Hashem

    Published 2013
    “…The main objective of this algorithm is to develop an adaptive persistence layer which consisted of reliable and smooth replication. …”
    Get full text
    Get full text
    Get full text
    Article
  7. 7
  8. 8
  9. 9

    Adaptive persistence layer for synchronous replication (PLSR) in heterogeneous system by Beg, Abul Hashem

    Published 2011
    “…Replication in the heterogeneous system is a very promising and challenging platform which is a compound of multi environment. …”
    Get full text
    Get full text
    Thesis
  10. 10
  11. 11

    Generalization of Map Details within Computer Assisted Cartography by Yusuf, Matharuddin

    Published 1992
    “…subjectivity in generalization, the metamorphasis from manual to digital techniques in cartography has resulted in the development of computer algorithms designed to replicate many tasks previously performed by humans. …”
    Get full text
    Get full text
    Article
  12. 12

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

    Secured agriculture sensor data based on end-to-end encryption using raspberry pi by Choo, Jia Huey

    Published 2025
    “…Additionally, a benchmarking tool was developed to evaluate and compare the performance of these algorithms in terms of speed, memory, CPU usage, and encryption overhead. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  14. 14

    An enhanced ant colony system algorithm for dynamic fault tolerance in grid computing by Saufi, Bukhari

    Published 2020
    “…The proposed algorithm was developed in a simulated grid environment called GridSim and evaluated against other fault tolerance algorithms such as trust-based ACO, fault tolerance ACO, ACO without fault tolerance and ACO with fault tolerance in terms of total execution time, average latency, average makespan, throughput, execution success rate and load balancing. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  15. 15

    Optimization of mobile robot path planning in semi-dynamic environment using genetic algorithm by Kasim Hawari, Mohd Zarifitri

    Published 2023
    “…Thus, this thesis aims to develop a mobile robot for industrial applications by leveraging a genetic algorithm (GA). …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  16. 16
  17. 17

    Towards a self-adaptive agent-based simulation model by Loo Y.L., Tang A.Y.C., Ahmad A., Mustapha A.

    Published 2023
    “…The capability to self-adapt will allow the model to be easily extended and replicated. The self-adapt capability is enabled by a governing algorithm within the model and is conceptually illustrated through a case study of crime report process ABS modelling. � 2005 - 2016 JATIT & LLS. …”
    Article
  18. 18

    Routing problem in rectangular mesh network using Dijkstra’s based Greedy method by Noraziah, Adzhar, Shaharuddin, Salleh, Yuhani, Yusof, Muhammad Azrin, Ahmad

    Published 2018
    “…In order to achieve this objective, each net need to be routed as shortest as possible. Therefore, developing a shortest path based routing algorithm is in need. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  19. 19

    A Novel Path Prediction Strategy for Tracking Intelligent Travelers by Motlagh, Omid Reza Esmaeili

    Published 2009
    “…The FCM nodes are a novel selection of kinematical factors. Genetic algorithm (GA) is then used to train the FCM to be able to replicate the decisional behaviors of the intelligent traveler. …”
    Get full text
    Get full text
    Thesis
  20. 20

    A sequential handwriting recognition model based on a dynamically configurable convolution recurrent neural network and hybrid salp swarm algorithm by Ahmed Ali Mohammed, Al-saffar

    Published 2024
    “…The built DCCRNN is based on the Salp Swarm optimization Algorithm (SSA), a processor that given a particular dataset will find the best CRNN’s structure and hyperparameters. …”
    Get full text
    Get full text
    Thesis