Search Results - (( time destination ((a algorithm) OR (_ algorithm)) ) OR ( level classification based algorithm ))

Refine Results
  1. 1

    Path planning for constant speed robot by Abdullah @ Idris, Ahmad Takiyuddin

    Published 2006
    “…At the moment, the guidance algorithm managed to assist the robot to reach the desired destination, within a certain small error tolerance. …”
    Get full text
    Get full text
    Thesis
  2. 2

    Parallel metaheuristic algorithm for route planning using CUDA by Looi, Daniel Jun Jie

    Published 2025
    “…Existing works that utilized metaheuristic algorithms have shown their flexibility in solving multiple TSP variants and their capabilities in obtaining near-optimal solutions within a reasonable amount of time. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  3. 3

    Analysis of Dijkstra’s and A* algorithm to find the shortest path by Alija, Amani Saleh

    Published 2015
    “…In this study, two algorithms will be focused on. This study compares the Dijkstra’s, and A* algorithm to estimate search time and distance of algorithms to find the shortest path. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  4. 4

    Exploration of genetic algorithm in network coding for wireless sensor networks by Teo, Kenneth Tze Kin, Chin, Renee Ka Yin, Tan, Shee Eng, Lee, Chun Hoe, Lim, Kit Guan

    Published 2014
    “…Genetic algorithm will search for optimum routes to the destination according to the desired throughput with a desired multicast rate. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  5. 5

    Autonomous path planning robot using geographical information by Ismail Ishaq Ibrahim

    Published 2008
    “…At the moment, the guidance algorithm managed to assist the robot to reach the desired destination, within a certain small error tolerance. …”
    Get full text
    Learning Object
  6. 6

    UiTM Malaysia route planner / Mohamad Yunus Mohamed Nasir by Mohamed Nasir, Mohamad Yunus

    Published 2008
    “…Route planner is a connecting route between a starting point and a point of destination, wherein the starting point, point of destination and connecting route. …”
    Get full text
    Get full text
    Thesis
  7. 7

    A study of vehicle routing problem via trade-off ranking method by Nor Izzati, Jaini, Adam Shariff Adli, Aminuddin, Farahanim, Misni, Zaitul Marlizawati, Zainuddin

    Published 2021
    “…Instead, to avoid congestion, a few algorithms use a randomized algorithm that routes a path to a randomly picked intermediate destination, and from there to its true destination. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  8. 8

    Route Optimization System by Zulkifli, Abdul Hayy

    Published 2005
    “…This algorithm is an exact algorithm that is specifically for finding the shortest route in a network. …”
    Get full text
    Get full text
    Final Year Project
  9. 9

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

    Published 2017
    “…In this paper, users requirement are determined based on the time taken to reach the destination station. The time taken to reach the destination station was influenced by how many stations that users need to pass through. …”
    Get full text
    Get full text
    Thesis
  10. 10

    Optimal path planning algorithms in virtual environments by Hassan, Rohayanti

    Published 2006
    “…In addition, Extended Prim algorithm was applied to shorten the travelling time and a virtual exhibition area was used as a domain to execute and analyse the algorithms performances. …”
    Get full text
    Get full text
    Thesis
  11. 11

    AUTOMATIC ROUTE FINDER FOR NEW VISITORS by ADNAN, MOHD SHIHAM

    Published 2006
    “…Automatic Route Finder tool for New Visitors is developed to help them to find or plan the shortest and effective way in order to reach their destination without loss of time. This project proposes a new visitor route model that is based on shortest path algorithms for road networks. …”
    Get full text
    Get full text
    Final Year Project
  12. 12
  13. 13

    An adaptive routing algorithm: enhanced confidence-based Q routing algorithm in network traffic by Yap, Soon Teck, Othman, Mohamed

    Published 2004
    “…However, the C value incompletely evaluates how closely the Q value represents the current condition of the network in a given length of time, which is measured in term of estimated delivery time for a packet to arrive at its destination. …”
    Get full text
    Get full text
    Get full text
    Article
  14. 14

    Travelling choices made easier using dijkstra algorithm / Wardah Mohd Nor and Noraini Noordin by Mohd Nor, Wardah, Noordin, Noraini

    “…In finding the minimum total travel cost and shortest total completion time for a journey between two destinations, the step-by-step Dijkstra algorithm was applied in the time-dependent shortest path problem (TDSPP) and cost-dependent shortest path problem (CDSPP) in this research. …”
    Get full text
    Get full text
    Get full text
    Article
  15. 15

    Efficient and stable routing algorithm based on user mobility and node density in urban vehicular network by Al-Mayouf, Y.R.B., Ismail, M., Abdullah, N.F., Wahab, A.W.A., Mahdi, O.A., Khan, S., Choo, R.K.K.

    Published 2016
    “…Therefore, this paper proposes a novel routing algorithm called efficient and stable routing algorithm based on user mobility and node density (ESRA-MD). …”
    Get full text
    Get full text
    Article
  16. 16

    An efficient innovative method to decrease routing table size in packet switched networks by Baygi, Maassoumeh Javadi, Ramli, Abdul Rahman, Zaeri, Bahram, Mohd Ali, Borhanuddin

    Published 2013
    “…More specifically, data routing tables which are established in the AntNet algorithm and keep the information of all destination nodes in network convert to tables that only keep the information of popular destinations of network. …”
    Get full text
    Get full text
    Get full text
    Article
  17. 17
  18. 18

    Enhanced Adaptive Confidence-Based Q Routing Algorithms For Network Traffic by Yap, Soon Teck

    Published 2004
    “…However, the C value incompletely evaluates how closely the Q value represents the current state of the network, which is measured in terms of estimated delivery time for a packet to arrive at its destination. An integrated solution for the above problem is the ECQ Routing Algorithm. …”
    Get full text
    Get full text
    Thesis
  19. 19

    Mobile Map-Based Positioning System Using Segmentation Algorithm (MM-BPS) by Migdady, Hazem Moh'd Ali

    Published 2008
    “…This paper reports steps to build a segmentation positioning algorithm and to implement Mobile Map-Based Positioning System prototype.…”
    Get full text
    Get full text
    Get full text
    Thesis
  20. 20

    AntNet: a robust routing algorithm for data networks by Haseeb, Shariq, Sidek, Khairul Azami, Ismail, Ahmad Faris, Weng Kin, Lai, Yit Mei, Aw

    Published 2004
    “…Convergence time for this algorithm on a nation-wide telecommunications network will also be discussed. …”
    Get full text
    Get full text
    Get full text
    Article