Search Results - (( a destination based algorithm ) OR ( panel classification based algorithm ))

Refine Results
  1. 1
  2. 2

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

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

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

    Published 2017
    “…Users are left to their own devices in order to figure out the best route based on their requirements. In this paper, users requirement are determined based on the time taken to reach the destination station. …”
    Get full text
    Get full text
    Thesis
  6. 6

    SNR Based DSDV Routing Protocol for MANET by Mohd Fairuz, Muhamad Fadzil

    Published 2012
    “…In this project the Signal-to-Noise (SNR) based routing protocol has been adapted into the standard Destination Sequenced Distance Vector (DSDV) routing algorithm by developing an algorithm to calculate the cumulative average SNR from source to destination and apply the algorithm in the DSDV routing protocol. …”
    Get full text
    Get full text
    Get full text
    Thesis
  7. 7

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

    Genetic algorithm based network coding in wireless ad hoc networks by Tan, Shee Eng

    Published 2013
    “…In this work, an adaptive genetic algorithm based coding-aware routing (AGACAR) is also proposed to improve the solution on the GACAR. …”
    Get full text
    Get full text
    Get full text
    Thesis
  9. 9

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

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

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

    Evaluation of efficient vehicular ad hoc networks based on a maximum distance routing algorithm by Al-Mayouf, Y.R.B., Abdullah, N.F., Ismail, M., Al-Qaraawi, S.M., Mahdi, O.A., Khan, S.

    Published 2016
    “…This routing is position-based, known as the maximum distance on-demand routing algorithm (MDORA). …”
    Get full text
    Get full text
    Article
  13. 13
  14. 14

    Evolutionary algorithm based network coding for optmization of intelligent vehicular ad hoc network by Lee, Chun Hoe

    Published 2017
    “…However, the chances to perform NC in wireless network is highly unlikely if the packet is not transmit to the potential NC node. Therefore, GA based network routing (GANeR) is embedded into network to search for shortest path from the source to the destination, and PSO based coding aware routing (CAR) is also proposed to further converge the solutions obtained from GANeR. …”
    Get full text
    Get full text
    Thesis
  15. 15

    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
    “…Taking into consideration the highly distributed character of networks, numerous multi-agent based algorithms, and particularly ant colony based algorithms, have been proposed in recent years. …”
    Get full text
    Get full text
    Get full text
    Article
  16. 16

    Power reduction quadrant-based directional routing protocol (Q-DIR) in mobile ad hoc network by A. Latif, Liza, Fisal, Norsheila, Ali, A.

    Published 2007
    “…This paper presents Quadrant- based directional routing protocol (Q-DIR) algorithm that limits the broadcast region to a quadrant where the destination node and source node are located. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  17. 17

    Reduced latency in restricted flooding routing protocol for mobile ad hoc network. by A. Latif, Liza, Ali, A., Fisal, Norsheila

    Published 2007
    “…This paper presents Quadrant-based directional routing protocol (Q-DIR) algorithm that restrict the broadcast region to a quadrant where the destination node and source node are located. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  18. 18

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

    Published 2012
    “…In the master project, the researcher discussed the shortest path solution to a single source problem based on Dijkstra algorithm as resolving the basic concepts. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  19. 19

    Artificial Bee Colony for Minimizing the Energy Consumption in Mobile Ad Hoc Network by Tareq, M., Abed, S.A., Sundararajan, E.A.

    Published 2019
    “…The aim of this paper is to find the best possible route from the source to the destination based on a method inspired by the searching behaviour of bee colonies, i.e. artificial bee colony (ABC) algorithm. …”
    Get full text
    Get full text
    Article
  20. 20

    A qualitative comparison of position-based routing protocols for ad-hoc networks by Qabajeh, L.K., Kiah, M.L.M., Qabajeh, M.

    Published 2009
    “…This paper presents an overview and a qualitative comparison of the existing Ad-Hoc routing protocols that make forwarding decisions based on the geographical position of a packet's destination. …”
    Get full text
    Get full text
    Get full text
    Article