Search Results - (( using simulation path algorithm ) OR ( _ optimization data algorithm ))

Refine Results
  1. 1

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

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

    A Continuous Overlay Path Probing Algorithm For Overlay Networks by Feily, Maryam

    Published 2013
    “…Several experiments were carried out using the OMNeT++ simulation framework. The designed algorithm was evaluated using experimental data. …”
    Get full text
    Get full text
    Thesis
  5. 5

    Novel algorithm for mobile robot path planning in constrained environment by Muhammad, Aisha, Ali, Mohammed A. H., Turaev, Sherzod, Shanono, Ibrahim Haruna, Hujainah, Fadhl, Mohd Zubir, Mohd Nashrul, Faiz, Muhammad Khairi, Mohd Faizal, Erma Rahayu, Abdulghafor, Rawad Abdulkhaleq Abdulmolla

    Published 2021
    “…The results demonstrated that the proposed method is able to generate efficiently an optimal collision-free path. Moreover, the performance of the proposed method was compared with the A-star and laser simulator (LS) algorithms in terms of path length, computational time and path smoothness. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  6. 6

    Novel algorithm for mobile robot path planning in constrained environment by Aisha, Muhammad, Ali, Mohammed A. H., Turaev, Sherzod, Shanono, Ibrahim Haruna, Hujainah, Fadhl, Mohd Nashrul, Mohd Zubir, Muhammad Khairi Faiz, ., Erma Rahayu, Mohd Faizal, Abdulghafor, Rawad

    Published 2022
    “…The results demonstrated that the proposed method is able to generate efficiently an optimal collision-free path. Moreover, the performance of the proposed method was compared with the A-star and laser simulator (LS) algorithms in terms of path length, computational time and path smoothness. …”
    Get full text
    Get full text
    Get full text
    Article
  7. 7

    Novel algorithm for mobile robot path planning in constrained environment by Muhammad, Aisha, Ali, Mohammed A. H., Turaev, Sherzod, Shanono, Ibrahim Haruna, Hujainah, Fadhl, Mohd Nashrul, Mohd Zubir, Muhammad Khairi, Faiz, Erma Rahayu, Mohd Faizal, Abdulghafor, Rawad

    Published 2022
    “…The results demonstrated that the proposed method is able to generate efficiently an optimal collision-free path. Moreover, the performance of the proposed method was compared with the A-star and laser simulator (LS) algorithms in terms of path length, computational time and path smoothness. …”
    Get full text
    Get full text
    Get full text
    Article
  8. 8

    Performance Analysis of Swarm Intelligence-Based Routing Protocol for Mobile Ad Hoc Network and Wireless Mesh Networks by Moghanjoughi, Ayyoub Akbari

    Published 2009
    “…By this procedure, IANRA is able to prevent some of the existing difficulties in AntNet, MACO and Ad hoc On Demand Distance Vector (AODV) routing algorithms. OMNeT++ was used to simulate the IARNA algorithm for WMNs and MANET. …”
    Get full text
    Get full text
    Thesis
  9. 9

    A noble approach of ACO algorithm for WSN by Sharmin, Afsah, Anwar, Farhat, Motakabber, S. M. A.

    Published 2018
    “…A noble approach of ant colony optimization (ACO) algorithm for discovering the optimum route in the WSNs for data transmission is proposed here for enhancement and optimization considering the issue of path selection to reach the nodes. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Proceeding Paper
  10. 10

    Multi agent quality of service routing based on scheme ant colony optimization algorithm by Baygi, Maassoumeh Javadi

    Published 2014
    “…This study also introduces a new probe-based procedure for discovery and setup QoS path for real-time traffic. The proposed scheme has been simulated by OMNET++ and compared with standard AntNet and two well-known standard QoS routings; Widest Shortest Path (WSP) algorithm and Shortest Widest Path (SWP) algorithm. …”
    Get full text
    Get full text
    Thesis
  11. 11

    An experimental study of neighbourhood based metaheuristic algorithms for test case generation satisfying the modified condition / decision coverage criterion by Haque, Ariful

    Published 2018
    “…Although useful, the existing algorithms does not provide any comparative data to select an algorithm based on the problem size and difficulty and the use of other neighborhood algorithms (including Great Deluge and Late Acceptance Hill Climbing) has not been sufficiently explored as well. …”
    Get full text
    Get full text
    Thesis
  12. 12

    Designated Path Routing Algorithm For Dense Wireless Sensor Network by Subramaniam, Siva Kumar, Ikhwan Lee, Mohamad Yusry Lee, Feroz, Farah Shahnaz, Azman, Amierul Syazrul Azril

    Published 2021
    “…The proposed algorithm has been developed to optimize the network performance by dividing the traffic into two and by reducing the flooding during route discovery. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  13. 13

    Test case generation from state machine with OCL constraints using search-based techniques / Aneesa Ali Ali Saeed by Aneesa Ali, Ali Saeed

    Published 2017
    “…The second contribution of this thesis is developing an accurate search-based test data generator for generating automatically optimal test data to satisfy the whole constraints in the path. …”
    Get full text
    Get full text
    Get full text
    Thesis
  14. 14

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

    Published 2016
    “…In order to evaluate the proposed algorithm, a series of experiments to implement Discrete Event Simulation (DES) of a LEO satellite network by using ns-2 and C/C++ are conducted. …”
    Get full text
    Get full text
    Get full text
    Thesis
  15. 15

    Smart geographical routing protocol achieving high QoS and energy efficiency based for wireless multimedia sensor networks by Hussein, Wael Ali, Mohd Ali, Borhanuddin, A. Rasid, Mohd Fadlee, Hashim, Fazirulhisyam

    Published 2021
    “…This algorithm routes multimedia packets across a WSN by choosing high- throughput paths rather than always choosing the shorter path to the sink. …”
    Get full text
    Get full text
    Article
  16. 16

    Enhancing quality of service in Multi-Radio Multi-Channel Wireless Mesh Networks by Raja Bongsu, Raja Hasyifah

    Published 2023
    “…The COngestion Reduction Routing Algorithm (CORRA) tackles this challenge by evaluating link quality and interference to find optimal data paths. …”
    Get full text
    Get full text
    Get full text
    Thesis
  17. 17

    Design and modelling of an autonomous robotic airship with soft computing control by Wong, Wei Kitt

    Published 2012
    “…Along with the prototype airship, a path planner was also proposed for the UAV for the purpose of obstacle avoidance and path optimization using genetic algorithm to minimize on the distance travelled and to generate the shortest path to cover the specified waypoints. …”
    Get full text
    Get full text
    Get full text
    Thesis
  18. 18
  19. 19

    Predetermined path of mobile data gathering in wireless sensor networks based on network layout by Ghaleb, Mukhtar, Subramaniam, Shamala, Othman, Mohamed, Ahmad Zulkarnain, Zuriati

    Published 2014
    “…The ME will select a centroid point between two sub-polling points, subsequently selecting common turning points as the core of the basis of the tour path. Extensive discrete-event simulations have been developed to assess the performance of the proposed algorithm. …”
    Get full text
    Get full text
    Article
  20. 20