Search Results - (( _ selection path algorithm ) OR ( java application based algorithm ))

Refine Results
  1. 1

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

    RSA Encryption & Decryption using JAVA by Ramli, Marliyana

    Published 2006
    “…The implementation of this project will be based on Rapid Application Design Methodology (RAD) and will be more focusing on research and finding, ideas and the implementation of the algorithm, and finally running and testing the algorithm. …”
    Get full text
    Get full text
    Final Year Project
  3. 3

    Optimal QoS aware multiple paths web service composition using heuristic algorithms and data mining techniques by Qtaish, Osama Kayed Taher

    Published 2014
    “…Second, both the constructive procedure (CP) and the complementary procedure (CCP) heuristic algorithms computed the optimization considering only the execution path that has been predicted by the runtime path prediction method for criteria selection, eight QoS characteristics are suggested after investigating related works on the area of web service and web service composition. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  4. 4

    Optimisation of Environmental Risk Assessment Architecture using Artificial Intelligence Techniques by Salem S. M. Khalifa

    Published 2024
    “…By contrast, the results of the safe path selection model were compared with the results obtained using Dijkstra's algorithm and the Floyd-Warshall algorithm. …”
    thesis::doctoral thesis
  5. 5

    A hybrid sampling-based path planning algorithm for mobile robot navigation in unknown environments by Khaksar, Weria

    Published 2013
    “…Sampling-based motion planning is a class of randomized path planning algorithms with proven completeness. …”
    Get full text
    Get full text
    Thesis
  6. 6

    A novel Bezier curve control point search algorithm for autonomous navigation using N-order polynomial search with boundary conditions by Sajith, Akhil Vinayak, Zakaria, M. A., Baarath, K., Anwar, P. P. Abdul Majeed

    Published 2021
    “…The process starts with random points selection along the path. Specific random points will be selected through which the curve should pass through. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  7. 7

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

    A O(|E|) Time Shortest Path Algorithm for Non-Negative Weighted Undirected Graphs by Qureshi, M.A., Hassan, M.F., Safdar, S., Akhbar, R.

    Published 2010
    “…The algorithm completes its execution in O(|E|) for all graphs except few in which longer path (in terms of number of edges) from source to some node makes it best selection for that node.…”
    Get full text
    Get full text
    Article
  9. 9

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

    Route optimization using shortest path method / Muhamad Faisal Amin Shakri by Shakri, Muhamad Faisal Amin

    Published 2025
    “…This study investigated the implementation and comparison between well known shortest path method which are Dijkstra’s algorithm, Bellman-Ford, and A* algorithm. …”
    Get full text
    Get full text
    Thesis
  11. 11

    Performance comparison between genetic algorithm and ant colony optimization algorithm for mobile robot path planning in global static environment / Nohaidda Sariff by Sariff, Nohaidda

    Published 2011
    “…The objective is to verify and compare the effectiveness of both algorithms in finding the optimal robot path in different types of global map environments. …”
    Get full text
    Get full text
    Thesis
  12. 12

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

    Published 2013
    “…Such an in-band probing algorithm reduces measurement overhead on the selected overlay path. …”
    Get full text
    Get full text
    Thesis
  13. 13
  14. 14

    Shortest Path Routing Using Heuristic Search by Alaiwan, Ahmed Omran A.

    Published 2006
    “…In this project A* algorithm was used, to suggest shortest path model between two selected points to find the fastest and shortest route on Malaysia map. …”
    Get full text
    Get full text
    Get full text
    Thesis
  15. 15
  16. 16

    Path planning for visually impaired people in an unfamiliar environment using particle swarm optimization by Yusof, T. S. T., Toha, Siti Fauziah, Md. Yusof, Hazlina

    Published 2015
    “…The PSO algorithm will optimise possible shortest route by minimizing the total cost for path length. …”
    Get full text
    Get full text
    Get full text
    Article
  17. 17

    Attack path selection optimization with adaptive genetic algorithms by Abd Rahman, A.S., Zakaria, M.N., Masrom, S.

    Published 2016
    “…Attack paths that satisfy certain optimization criteria are then selected and presented as possible components of the security solution. …”
    Get full text
    Get full text
    Article
  18. 18

    Attack path selection optimization with adaptive genetic algorithms by Abd Rahman, A.S., Zakaria, M.N., Masrom, S.

    Published 2016
    “…Attack paths that satisfy certain optimization criteria are then selected and presented as possible components of the security solution. …”
    Get full text
    Get full text
    Article
  19. 19

    Weighted Sum-Dijkstra’s Algorithm in Best Path Identification based on Multiple Criteria by Ting, Kien Hua, Noraini Abdullah

    Published 2018
    “…Dijkstra’s Algorithm is a shortest path algorithm that considers a single criterion only. …”
    Get full text
    Get full text
    Get full text
    Article
  20. 20

    Evaluation of robot path planning algorithms in global static environments: genetic algorithm vs ant colony optimization algorithm / Nohaidda Sariff and Norlida Buniyamin by Sariff, Nohaidda, Buniyamin, Norlida

    Published 2010
    “…Performances between both algorithms were compared and evaluated in terms of speed and number of iterations that each algorithm takes to find an optimal path within several selected environments. …”
    Get full text
    Get full text
    Get full text
    Article