Search Results - (( its application ((path algorithm) OR (acs algorithm)) ) OR ( based replication _ algorithm ))*

Refine Results
  1. 1

    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
  2. 2
  3. 3
  4. 4
  5. 5
  6. 6

    DC-based PV-powered home energy system by Sabry, Ahmad H.

    Published 2017
    “…By contrast, the charge controller exchanges to an auxiliary load path when the battery bank reaches its full charge value. …”
    Get full text
    Get full text
    Thesis
  7. 7

    IMPLEMENTATION OF GRAPH BASED PATH PLANNING ALGORITHMS FOR INDOOR NAVIGATION by SYED KHAIZURA, SYED HUSEIN KAMIL

    Published 2018
    “…Thus, the A* algorithm is implemented in a small mobile robot, this is to see its effectiveness in real world application. …”
    Get full text
    Get full text
    Final Year Project
  8. 8

    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
  9. 9
  10. 10
  11. 11

    Performance comparison of a and Dijkstra algorithms with bézier curve in 2D grid and OpenStreetMap scenarios by Yusuf, Zakariah, Mohamad, Sufian, Wan Ibrahim, Wan Suhaifiza

    Published 2025
    “…On the other hand, Dijkstra's algorithm, though robust and optimal, exhibited longer runtimes and produced paths with more turns due to its exhaustive search approach. …”
    Get full text
    Get full text
    Get full text
    Article
  12. 12

    Comparison of path planning in simulated robot by Ch’ng, Chee Yu’ng

    Published 2020
    “…This is because each path planning algorithm has its own applicable domain, performance, advantages and disadvantages in various situations. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  13. 13
  14. 14

    Online dynamic replication and placement algorithms for cost optimization of online social networks in two-tier multi-cloud by Aldailamy, Ali Y., Muhammed, Abdullah, Latip, Rohaya, Hamid, Nor Asilah Wati Abdul, Ismail, Waidah

    Published 2024
    “…The second algorithm is Dynamic Exponential Time (DET) which determines the data object replication and placement based on exponential time periods. …”
    Get full text
    Get full text
    Get full text
    Article
  15. 15

    Simulation of shortest path using a-star algorithm / Nurul Hani Nortaja by Nurul Hani , Nortaja

    Published 2004
    “…This thesis also provides an explanation about the advantages. functions, characteristics. the degree of complexity in A • algorithm and its implementation in real-world application. …”
    Get full text
    Get full text
    Thesis
  16. 16
  17. 17

    Modeling dynamic weight for 3D navigation routing by Musliman, Ivin Amri, Abdul Rahman, Alias, Coors, Volker

    Published 2007
    “…Currently, most of shortest path algorithm used in GIS application is often not sufficient for efficient management in time-critical applications such as emergency response applications. …”
    Get full text
    Get full text
    Conference or Workshop Item
  18. 18
  19. 19

    An adaptive data replication and placement for efficient data storage of online social networks using two-tier multi-cloud environment by Al-Dailamy, Ali Y., Muhammed, Abdullah, Latip, Rohaya, Abdul Hamid, Nor Asila Wati, Esmail, Waidah

    Published 2022
    “…The second algorithm is Dynamic Exponential Time (DET) which determines the data object replication and placement based on exponential time periods. …”
    Get full text
    Get full text
    Article
  20. 20

    Railway shortest path planner application using ant colony optimization algorithm / Muhammad Hassan Firdaus Ruslan by Ruslan, Muhammad Hassan Firdaus

    Published 2017
    “…For the process module, Ant Colony Optimization (ACO) algorithm was used to find the shortest path. Using ACO, a Railway Shortest Path Planner (RSPP) application will be developed to help user determine their shortest path from one station to another. …”
    Get full text
    Get full text
    Thesis