Search Results - (( java implementation path algorithm ) OR ( based replication process algorithm ))

Search alternatives:

Refine Results
  1. 1
    Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer

    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
    Save to List
    Saved in:
  2. 2
    Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization

    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
    Save to List
    Saved in:
  3. 3
    Path planning for unmanned aerial vehicle (UAV) using rotated accelerated method in static outdoor environment

    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
    Save to List
    Saved in:
  4. 4
    Smart appointment organizer for mobile application / Mohd Syafiq Adam

    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
    Save to List
    Saved in:
  5. 5
    Managing Heterogeneous Database Replication Using Persistence Layer Synchronous Replication (PLSR)

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

    Published 2013
    “…It achieves faster time execution and cost minimization than that other replication processes. This algorithm also introduces a multi thread based persistence layer, which supports early binding and parallel connection to the servers. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  6. 6
    Dynamic replication aware load blanced scheduling in distributed environment / Said Bakhshad

    Dynamic replication aware load blanced scheduling in distributed environment / Said Bakhshad by Said Bakhshad, Bakhshad

    Published 2018
    “…In this case, if jobs are not scheduled properly at particular points, the processing resources will be squandered. We propose a novel dynamic Replication Aware Load Balanced Scheduling (DRALBS) algorithm, that considers the replica location dynamically at the time of the scheduling of the job. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  7. 7
    Efficient multi-cloud storage using online dynamic replication and placement algorithms for online social networks

    Efficient multi-cloud storage using online dynamic replication and placement algorithms for online social networks by Aldailamy, Ali Y., Muhammed, Abdullah, Abdul Hamid, Nor Asilah Wati, Latip, Rohaya, Ismail, Waidah

    Published 2024
    “…The DTS algorithm establishes the replication and placement of objects using deterministic time slots, while the RTS algorithm is based on randomized time slots. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  8. 8
    Efficient Multi-Cloud Storage Using Online Dynamic Replication and Placement Algorithms for Online Social Networks

    Efficient Multi-Cloud Storage Using Online Dynamic Replication and Placement Algorithms for Online Social Networks by Ali Y. Aldailamy, Abdullah Muhammed, Nor Asilah Wati Abdul Hamid, Rohaya Lati, Waidah Ismail

    Published 2024
    journal::journal article
    Save to List
    Saved in:
  9. 9
    Adaptive persistence layer for synchronous replication (PLSR) in heterogeneous system

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

    Published 2011
    “…Nowadays, in the grid community, distributed and clustering system, a lot of work has been focused on providing efficient and safe replication management services through designing of algorithms and systems. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  10. 10
    Binary vote assignment on grid quorum replication technique with association rule

    Binary vote assignment on grid quorum replication technique with association rule by Ainul Azila, Che Fauzi

    Published 2018
    “…Then, the databases that are resulted after the fragmentation process are allocated at their assigned sites. Finally, after allocation process, each site has a database file and ready for any transaction and replication process. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  11. 11
    An Enhanced Simulated Annealing Routing Algorithm for Semi-Diagonal Torus Network

    An Enhanced Simulated Annealing Routing Algorithm for Semi-Diagonal Torus Network by Noraziah, Adzhar, Shaharuddin, Salleh

    Published 2017
    “…In order to achieve this objective, each node must be connected in its shortest way as possible. We start our algorithm by designing shortest path algorithm based on Dijkstra's method. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  12. 12
    A comparative analysis of image copy-move forgery detection algorithms based on hand and machine-crafted features

    A comparative analysis of image copy-move forgery detection algorithms based on hand and machine-crafted features by Ahmed I.T., Hammad B.T., Jamil N.

    Published 2023
    “…However, these surveys are not covered for both IC-MFD algorithms based hand-crafted features and IC-MFDs algorithms based machine-crafted features. …”
    Article
    Save to List
    Saved in:
  13. 13
    A Self-Adaptive Agent-Based Dynamic Processes Simulation Modelling Framework

    A Self-Adaptive Agent-Based Dynamic Processes Simulation Modelling Framework by Loo Y.L., Ahmad A., Mustapha A., Mostafa S.A.

    Published 2023
    Conference Paper
    Save to List
    Saved in:
  14. 14
    A sequential handwriting recognition model based on a dynamically configurable convolution recurrent neural network and hybrid salp swarm algorithm

    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
    “…This research present a dynamic configurator of the CRNN (DC-CRNN), geared for sequence learning in the context of handwriting recognition, inspired by bio-inspired approaches. 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
    Save to List
    Saved in:
  15. 15
    A Novel Wrapper-Based Optimization Algorithm for the Feature Selection and Classification

    A Novel Wrapper-Based Optimization Algorithm for the Feature Selection and Classification by Talpur, N., Abdulkadir, S.J., Hasan, M.H., Alhussian, H., Alwadain, A.

    Published 2023
    “…The SCSO algorithm replicates the hunting and searching strategies of the sand cat while having the advantage of avoiding local optima and finding the ideal solution with minimal control variables. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  16. 16
    A Theoretical Comparative Analysis Of Dna Techniques Used In Dna Based Cryptography

    A Theoretical Comparative Analysis Of Dna Techniques Used In Dna Based Cryptography by Nik Azura Nik Abdullah, Nur Hafiza Zakaria, Farida Hazwani Mohd Ridzuan, Azuan Ahmad, Kamaruzzaman Seman, Suriyani Ariffin, Azni Hazlizan Ab Halim

    Published 2024
    Get full text
    journal::journal article
    Save to List
    Saved in:
  17. 17
    Cloud Worm Detection and Response Technique By Integrating The Enhanced Genetic Algorithm An Threat Level

    Cloud Worm Detection and Response Technique By Integrating The Enhanced Genetic Algorithm An Threat Level by Hasan Mahmoud Sha'ban Kanaker

    Published 2024
    thesis::doctoral thesis
    Save to List
    Saved in:
  18. 18
    A self-adaptive agent-based simulation modelling framework for dynamic processes

    A self-adaptive agent-based simulation modelling framework for dynamic processes by Ling, Loo Yim, Dr.

    Published 2023
    “…Agent-based simulation (ABS) modelling had been a prevalent approach for simulation of dynamic processes of various domains. …”
    text::Thesis
    Save to List
    Saved in:
  19. 19
    An enhanced ant colony system algorithm for dynamic fault tolerance in grid computing

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

    Published 2020
    “…Most fault tolerance algorithms focus on fault handling techniques such as task reprocessing, checkpointing, task replication, penalty, and task migration. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  20. 20
    Routing problem in rectangular mesh network using Dijkstra’s based Greedy method

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

    Published 2018
    “…A supercomputer can have thousands of replicated processor-memory pairs which are called processing pins. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:

Search Tools: