Search Results - (( parallel evaluation method algorithm ) OR ( changes optimization path algorithm ))

Refine Results
  1. 1

    Search algorithms for path planning problems in harsh wireless sensor network environment by Hong, Siaw Swin

    Published 2017
    “…The three addressed problems are 1) long initial computation delay in dynamic environment, 2) slow reaction towards rapid change of goal points and massive number of node depending on single source of computational power, and 3) tradeoffs between optimality and computational effort to achieve optimality in TSP path planning problem. …”
    Get full text
    Get full text
    Thesis
  2. 2

    Application of the Bees Algorithm to find optimal drill path sequence by Zainal Abidin, Muhammad Harith, Kamaruddin, Shafie, Adam Malek, Afiqah, Sukindar, Nor Aiman

    Published 2024
    “…The main finding of the study is that the Bees Algorithm found optimal drill path length and minimum machining time comparable to the results of the other algorithms for the 5 × 5, 7 × 7 and 9 × 9 problems. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Proceeding Paper
  3. 3

    Autonomous mobile robots path planning with integrative edge cloud-based ant colony optimization by Nor Azmi, Siti Nur Lyana Karmila, Anwar Apandi, Nur Ilyana, Rafique, Majid, Muhammad, Nor Aishah

    Published 2025
    “…However, traditional Ant Colony Optimization (ACO) algorithms, widely used for AMR path planning, exhibit limitations such as low convergence rates and redundant recalculations, particularly in environments with frequently changing obstacles. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  4. 4

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

    Published 2014
    “…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
  5. 5

    Optimised multi-robot path planning via smooth trajectory generation by Loke, Zhi Yu

    Published 2024
    “…Particle swarm optimization (PSO) outperforms conventional methods like artificial potential fields (APF), the Dijkstra algorithm, and the A* algorithm in path planning for mobile robots. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  6. 6
  7. 7

    Parallel Execution of Runge-Kutta Methods for Solving Ordinary Differential Equations by Siri, Zailan

    Published 2004
    “…The method used here is actually have been tailored made for the purpose of parallel machine where the subsequent functions evaluations do not depend on the previous function evaluations. …”
    Get full text
    Get full text
    Thesis
  8. 8
  9. 9
  10. 10
  11. 11
  12. 12
  13. 13
  14. 14
  15. 15
  16. 16

    Parallel algorithms for numerical simulations of EHD ion-drag micropump on distributed parallel computing systems by Shakeel Ahmed, Kamboh

    Published 2014
    “…To implement the parallel algorithms a distributed parallel computing laboratory using easily available low cost computers is setup. …”
    Get full text
    Get full text
    Thesis
  17. 17

    Hybrid Optimization with Enhanced QoS-based Path Selection in VANETs by F. Al-dolaimy, F. Al-dolaimy, Rabei Raad Ali, Rabei Raad Ali, Noor Nabeel, Noor Nabeel

    Published 2023
    “…The EWOA algorithm is used for initial optimal path selection, and ACO is used to find the best optimal solution to achieve effective communication in VANETs. …”
    Get full text
    Get full text
    Get full text
    Article
  18. 18

    Enhancing performance of XTS cryptography mode of operation using parallel design by Ahmed Alomari, Mohammad

    Published 2009
    “…In addition, the parallel XTS mode was also simulated using Twofish and RC6 encryption algorithms. …”
    Get full text
    Get full text
    Thesis
  19. 19

    Parallel execution of diagonally implicit Runge-Kutta methods for solving IVPs. by Ismail, Fudziah, Siri, Zailan, Othman, Mohamad, Suleiman, Mohamed

    Published 2009
    “…Diagonally Implicit Runge-Kutta (DIRK) methods are amongst the most useful and cost-effective methods for solving initial value problems but the dependency of the functions evaluations on the previous functions evaluations makes DIRK method not so favourable for parallel computers. …”
    Get full text
    Get full text
    Article
  20. 20