Search Results - (( time evaluation path algorithm ) OR ( risk optimization path algorithm ))

Refine Results
  1. 1

    Route optimization security in mobile IPv6 wireless networks: a test-bed experience by Mehdizadeh, Abbas, Khatun, Sabira, Mohd Ali, Borhanuddin, Raja Abdullah, Raja Syamsul Azmir, Kurup, Gopakumar

    Published 2008
    “…Route Optimization (RO) is standard in Mobile IPv6 (MIPv6) to route packets between Mobile Node (MN) and Correspondent Node (CN) using shortest possible path. …”
    Get full text
    Get full text
    Conference or Workshop Item
  2. 2

    Security enhancement of route optimization in mobile IPv6 networks by Mehdizadeh, Abbas, Khatun, Sabira, Mohd Ali, Borhanuddin, Raja Abdullah, Raja Syamsul Azmir, Kurup, Gopakumar

    Published 2008
    “…Mobile IPv6 (MIPv6) allows Mobile Node (MN) to be always addressable by its home address. Route Optimization (RO) is standard in MIPv6 to route packets between MN and Correspondent Node (CN) using shortest possible path. …”
    Get full text
    Get full text
    Get full text
    Article
  3. 3
  4. 4
  5. 5
  6. 6
  7. 7
  8. 8
  9. 9
  10. 10

    Embedded Dual Band Rfid Based Blood Glucose Monitoring System For Internet Of Medical Things by Hamid, Shabinar Abdul

    Published 2020
    “…These two parameters are then taken into account in experimental setup for performance evaluation of the enhanced CSMA/CA (EN-CSMA/CA) algorithm that uses an external interrupt mechanism and a cross layer approach. …”
    Get full text
    Get full text
    Thesis
  11. 11

    An efficient algorithm to improve oil-gas pipelines path by Hasan Almaalei, Nabeel Naeem, Mohd Razali, Siti Noor Asyikin, Mohammed Alduais, Nayef Abdulwahab

    Published 2018
    “…In order to show the efficiency of the proposed algorithm, comparison between ant colony optimization (ACO) algorithm and a real current meth-od of linking is used for this purpose. …”
    Get full text
    Article
  12. 12
  13. 13
  14. 14
  15. 15

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

    Optimal QoS aware multiple paths web service composition using heuristic algorithms and data mining techniques by Qtaish, Osama Kayed Taher

    Published 2014
    “…However, when compositions contain more than one execution path (i.e., multiple path's compositions), it is difficult to generate a composite service that simultaneously optimizes all the execution paths involved in the composite service at the same time while meeting the QoS requirements. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  17. 17

    Shortest Path Trajectory System Based on Dijkstra Algorithm by Putri, Indah Pratiwi

    Published 2012
    “…This project aims to determine locations of the node that reflect all the items in the list, build the route by connecting nodes and evaluate the proposed algorithm for the single source shortest path problem. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  18. 18

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

    Published 2004
    “…Definitely this best first search algorithm saves the searching time and improves performance of shortest path finding.…”
    Get full text
    Get full text
    Thesis
  19. 19

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

    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
    “…The problem is to find the global path that satisfies the optimization criteria, which are shorter path length and less computation time. …”
    Get full text
    Get full text
    Thesis