Search Results - (( data optimization path algorithm ) OR ( data location based algorithm ))

Refine Results
  1. 1

    Finding the optimal road routes between two locations in East Kuala Lumpur by using A* Algorithm based on GPS data / Ilina Syazwani Musa by Musa, Ilina Syazwani

    Published 2007
    “…The research efforts have been done over the years by the researchers around the world by using a number of different algorithms and different cases study. In this paper, we will use A* algorithm in road route in East Kuala Lumpur based on GPS data on the Garmin platform. …”
    Get full text
    Get full text
    Thesis
  2. 2

    Resource-Efficient Coverage Path Planning for UAV-Based Aerial IoT Gateway by Nurul Saliha A. Ibrahim, Nurul Saliha A. Ibrahim, Faiz A. Saparudin, Faiz A. Saparudin

    Published 2023
    “…The EECPP is composed of two algorithms: the Stop Point Prediction Algorithm using K-Means, and Path Planning Algorithm using Particle Swarm Optimization. …”
    Get full text
    Get full text
    Get full text
    Article
  3. 3

    Controller placement problem in the optimization of 5G based SDN and NFV architecture by Ibrahim, Abeer Abdalla Zakaria

    Published 2021
    “…In addition, energy savings of up to 70% are achieved compared to the proposed Dijkstra-based energy-aware algorithms.…”
    Get full text
    Get full text
    Thesis
  4. 4

    Using artificial intelligence search in solving the camera placement problem by Altahir, A.A., Asirvadam, V.S., Hamid, N.H.B., Sebastian, P.

    Published 2022
    “…The computation of the coverage table offers essential data to formulate the search space. Furthermore, in order to locate the solution to the problem, each search strategy defines a unique path throughout the search space. …”
    Get full text
    Get full text
    Book
  5. 5

    Hybrid LTE-VANETs Based Optimal Radio Access Selection by Ayoob, Ayoob A., Su, Gang, Wang, Desheng, Mohammed, Muamer N., Hammood, Omar A.

    Published 2018
    “…In road networks, the mutual metric for the location of the optimal route relaying on two points is either the length of the path or the time of the trip. …”
    Get full text
    Get full text
    Get full text
    Book Chapter
  6. 6

    Dynamic area coverage algorithms for static and mobile wireless sensor network environments using voronoi techniques by Ceesay, Omar M.

    Published 2011
    “…This thesis focuses on developing Voronoi Tessellation-based Coverage Optimization Algorithms for Static and Mobile Wireless Sensor Networks, where a large number of static nodes are supported by few mobile nodes in carrying out the sensing task. …”
    Get full text
    Get full text
    Thesis
  7. 7

    Accurate range free localization in multi-hop wireless sensor networks by Abdulwahhab, Abdullah Raed

    Published 2019
    “…To localize wireless sensor networks (WSN)s nodes, only the hop-based data have been so far utilized by range free techniques, with poor-accuracy, though. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  8. 8

    A reliable time base routing framework with seamless networking operation for SDN / Nauman Khan by Nauman , Khan

    Published 2024
    “…This thesis presents a preventive maintenance time-based routing framework (PMTRF) to optimize the recovery of data plane failures in SDN-based networks during maintenance, such as multiple links or switch failures. …”
    Get full text
    Get full text
    Get full text
    Thesis
  9. 9
  10. 10
  11. 11

    A generalized laser simulator algorithm for optimal path planning in constraints environment by Aisha, Muhammad

    Published 2022
    “…The results demonstrated that the proposed method could generate an optimal collision-free path. Moreover, the proposed algorithm result are compared to some common algorithms such as the A* algorithm, Probabilistic Road Map, RRT, Bi-directional RRT, and Laser Simulator algorithm to demonstrate its effectiveness. …”
    Get full text
    Thesis
  12. 12

    An Experiment of Ant Algorithms : Case Study of Kota Kinabalu Central Town by Nor Rafidah, Mohamad

    Published 2005
    “…There are many algorithms that used to solve this problem. In this study, ant algorithms are used to find the shortest path using a real data. …”
    Get full text
    Get full text
    Get full text
    Thesis
  13. 13

    High Rise Building Evacuation Route Model Using DIJKSTRA'S Algorithm by Mohd Sabri, Nor Amalina

    Published 2015
    “…As a result, the evacuation route model is able to gain the shortest path and safest path consistently between Dijkstra’s algorithms and hybrid version which is Dijkstra-Ant Colony Optimization (DACO). …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  14. 14

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

    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. …”
    Get full text
    Get full text
    Thesis
  16. 16
  17. 17

    Design of radix-4 single path delay fast fourier transform processor with genetic algorithms optimization by Pang, Jia Hong

    Published 2011
    “…This research work involves the implementation of Single Objective Genetic Algorithm (SOGA) and Multi-objectives Genetic Algorithm (MOGA) in a 16-point Radix-4 Single Path Delay Feedback (R4SDF) pipelined Fast Fourier Transform (FFT) processor. …”
    Get full text
    Get full text
    Thesis
  18. 18
  19. 19
  20. 20