Search Results - (( software selection path algorithm ) OR ( changes optimization path algorithm ))

Refine Results
  1. 1

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

    Published 2024
    “…PMTRF modules and their algorithms enable the isolation of the maintenance switch and the selection of the most reliable path for future affected flows based on input time provided by the administrator. …”
    Get full text
    Get full text
    Get full text
    Thesis
  2. 2

    Evolutionary cost-cognizant regression test case prioritization for object-oriented programs by Bello, AbdulKarim

    Published 2019
    “…TCS attempts to identify test cases that have the same relevance to some set of changes. This technique has the problem of selecting a significant number of test cases even for small changes made to a software. …”
    Get full text
    Get full text
    Thesis
  3. 3
  4. 4

    Automated path testing using the negative selection algorithm by Shayma Mustafa Mohi-Aldeen, Radziah Mohamad, Safaai Deris

    Published 2017
    “…Negative selection algorithm (NSA) has been used in this paper to generate test data for path testing automatically. …”
    Get full text
    Get full text
    Indexed Article
  5. 5

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

    Path Selection With Critical Switch-Aware For Software Defined Networking by Isyaku, B., Bakar, K.B.A., Ghaleb, F.A., Zahid, M.S.M.

    Published 2021
    “…However, the traditional path selection algorithms failed to consider the switch role during the path selection process. …”
    Get full text
    Get full text
    Conference or Workshop Item
  7. 7

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

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

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

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

    The performance effect due to varying network topologies on a software-defined network employing the k-shortest path by Linsheng, R., Derahman, M. N., Kadir, M. F. A., Mohamed, M. A., Kamarudin, S.

    Published 2022
    “…SDN controller uses the Dijkstra algorithm to find the shortest path calculated from the source node to the destination node. …”
    Get full text
    Get full text
    Article
  14. 14

    Path planning for unmanned aerial vehicles using visibility line-based methods by Omar, Rosli

    Published 2011
    “…In order to ensure that the 3D path planning algorithms are computationally efficient, the proposed 2D path planning algorithms are applied into them. …”
    Get full text
    Get full text
    Thesis
  15. 15
  16. 16
  17. 17
  18. 18
  19. 19
  20. 20