Search Results - (( data optimization path algorithm ) OR ( parameter evaluation from algorithm ))

Refine Results
  1. 1

    Traffic management algorithms for LEO satellite networks by Huyop @ Ayop, Fahrul Hakim

    Published 2016
    “…In dealing with traffic routing problem, two algorithms, Dijkstra's Shortest Path and Genetic Algorithm (GA) are combined together and enhanced to re-strategize a better routing mechanism for a heterogeneous mix of traffic classes ranging from traditional voice calls to multimedia data services in Low Earth Orbit (LEO) satellite networks. …”
    Get full text
    Get full text
    Get full text
    Thesis
  2. 2

    Workload performance evaluation of large spatial database for DSS based disaster management by Rohman, Muhammad Syaifur

    Published 2017
    “…Data recorded in the shortest path analysis process reveals that the evaluation and the prediction on workload performance of shortest path analysis using Dijkstra algorithm has been well implemented. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  3. 3

    Ant system with heuristics for capacitated vehicle routing problem by Tan, Wen Fang

    Published 2013
    “…Finally, the proposed ASH was tested on two well known benchmark data sets to evaluate its performance and effectiveness. …”
    Get full text
    Get full text
    Thesis
  4. 4
  5. 5

    Optimization Method Using Modified Harmony Search For Coverage And Energy Efficiency In Wireless Sensor Network by Halim, Nurul Hamimi

    Published 2018
    “…However,the sink node position and size of data transmitted will not affect the performance of coverage area.This is because the coverage area value is fluctuated as the parameters value increases.Throughout the experiment conducted,sensor nodes deployed using Modified Harmony Search algorithm (MHS) gives better coverage area compared to other existing methods.The average coverage area percentage obtained by Modified Harmony Search is 63 %.The average coverage area percentage obtained by Modified Random is 48 % and the average coverage area percentage obtained by Harmony Search is 46 %.The highest coverage area recorded for Modified Harmony Search is 70 %.To enhance the energy efficiency,shortest path distance finder is added to each method.Throughout the research,Modified Harmony Search with shortest path distance finder gives optimum results.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  6. 6

    Modeling and control of a Pico-satellite attitude using Fuzzy Logic Controller by Zaridah, Mat Zain

    Published 2010
    “…The optimization technique involved from two points to four points and end with six points. …”
    Get full text
    Thesis
  7. 7
  8. 8
  9. 9

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

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

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

    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
  13. 13
  14. 14

    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
  15. 15
  16. 16
  17. 17
  18. 18
  19. 19
  20. 20