Search Results - (( _ evaluations path algorithm ) OR ( based replication system algorithm ))*

Refine Results
  1. 1

    Mobile Crowd Steering Evacuation Model via Agent Based Simulation by Applying the Social Force Model by Norhaida, Binti Hussain, Wai Shiang, Cheah, Wai Loke, Seng

    Published 2025
    “…Famous simulation models include agent-based crowd guiding. The evaluation states that the existing agent-based steering model computes the complete set of collision-free paths with the least travel time among agents to make path decisions based on updated information. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  2. 2

    Relationship based replication algorithm for data grid by Yusof, Yuhanis

    Published 2014
    “…The Relationship based Replication algorithm aims to improve the Data Grid performance by reducing the job execution time, bandwidth and storage usage.The RBR was realized using a network simulation (OptorSim) and experiment results revealed that it offers better performance than existing replication algorithms.…”
    Get full text
    Get full text
    Monograph
  3. 3

    Dynamic replication algorithm in data grid: Survey by K. Madi, Mohammed, Hassan, Suhaidi

    Published 2008
    “…A dynamic replication model based on mathematical concepts is proposed. …”
    Get full text
    Get full text
    Get full text
    Book Section
  4. 4

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

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

    Evaluation of robot path planning algorithms in global static environments: genetic algorithm vs ant colony optimization algorithm / Nohaidda Sariff and Norlida Buniyamin by Sariff, Nohaidda, Buniyamin, Norlida

    Published 2010
    “…Performances between both algorithms were compared and evaluated in terms of speed and number of iterations that each algorithm takes to find an optimal path within several selected environments. …”
    Get full text
    Get full text
    Get full text
    Article
  7. 7

    A framework for implementing asynchronous replication scheme in utility-based computing environment by Wan Nor Shuhadah, W.N., Zhou, B.B., Zomaya, A.Y., Abawajy, J.H.

    Published 2016
    “…This paper addresses a problem on implementing an asynchronous replication scheme in utility-based computing environment. …”
    Get full text
    Get full text
    Conference or Workshop Item
  8. 8

    Multi-robot path planning based on the improved nutcracker optimization algorithm and the dynamic window approach by Zhao, Jiangrong, Ding, Hongwei, Zhu, Yuanjing, Yang, Zhijun, Hu, Peng, Wang, Zongshan

    Published 2024
    “…This paper proposes a multi-robot path planning algorithm that integrates the improved nutcracker optimization algorithm with the improved dynamic window approach. …”
    Get full text
    Get full text
    Get full text
    Article
  9. 9

    A hybrid sampling-based path planning algorithm for mobile robot navigation in unknown environments by Khaksar, Weria

    Published 2013
    “…Sampling-based motion planning is a class of randomized path planning algorithms with proven completeness. …”
    Get full text
    Get full text
    Thesis
  10. 10

    A Framework for Asynchronous Replication Scheme for Utility-based Computing Environment by Wan Nor Shuhadah, Wan Nik, Zhou, Bing Bing, Zomaya, Albert Y

    Published 2015
    “…This paper addresses a problem on implementing an asynchronous replication scheme in utility-based computing environment. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  11. 11

    Efficient access of replicated data in distributed database systems by Mat Deris, Mustafa

    Published 2001
    “…The system combines the replication and transaction techniques and embeds these techniques into the TDGS-RP system. …”
    Get full text
    Get full text
    Thesis
  12. 12
  13. 13
  14. 14

    Wide area measurement system in the IEEE-14 bus system using multiobjective shortest path algorithm for fault analysis by Awalin, Lilik J., Syahirah, Abd Halim, Jafferi, Jamaludin, Nor Azuana, Ramli

    Published 2021
    “…To evaluate the performance of the multi-objective shortest path algorithm, all sections of the IEEE-14 bus system were simulated with faults. …”
    Get full text
    Get full text
    Get full text
    Article
  15. 15

    Replica Creation Algorithm for Data Grids by Madi, Mohammed Kamel

    Published 2012
    “…Current algorithms focus on number of accesses in deciding which file to replicate and where to place them, which ignores resources’ capabilities. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  16. 16

    Comparative Study of Weighted Product–Dijkstra’s Algorithm and All Possible Path Approach Based on Multiple Criteria and Multi-Dimensions by Ting Kien Hua, Noraini Abdullah

    Published 2020
    “…Dijkstra’s algorithm was one of the shortest path algorithms that would be used to identify the path with the least cost. …”
    Get full text
    Get full text
    Get full text
    Article
  17. 17

    A cluster-based hybrid replica control protocol for high availability in data grid by Mabni, Zulaile

    Published 2019
    “…The growing number of nodes has raised few issues in data replication. The first issue is, nodes in the Grid systems are dynamic where they can join or leave the system at any time. …”
    Get full text
    Get full text
    Thesis
  18. 18

    Performance comparison between genetic algorithm and ant colony optimization algorithm for mobile robot path planning in global static environment / Nohaidda Sariff by Sariff, Nohaidda

    Published 2011
    “…Subsequently, both algorithms were applied to the test environments. Finally, the performances of both algorithms were analyzed and evaluated based on the required criteria. …”
    Get full text
    Get full text
    Thesis
  19. 19

    A Continuous Overlay Path Probing Algorithm For Overlay Networks by Feily, Maryam

    Published 2013
    “…Several experiments were carried out using the OMNeT++ simulation framework. The designed algorithm was evaluated using experimental data. The obtained results show that the continuous in-band overlay path probing algorithm (COPPA) provides up-to-date bandwidth information with reduced overhead and minimal impact on the traffic of the path.…”
    Get full text
    Get full text
    Thesis
  20. 20

    Performance analysis of genetic algorithm (GA)-based multi-constrained path routing algorithm by Yussof S.

    Published 2023
    “…The performance of the algorithm is then compared with an exact algorithm called the depth first search and a common shortest path algorithm called the Dijkstra's algorithm. …”
    Article