Search Results - (( java application testing algorithm ) OR ( based costing path algorithm ))

Search alternatives:

Refine Results
  1. 1
    Shortest path from Bandar Tun Razak to Berjaya Times Square using Dijkstra Algorithm / Nur Syuhada Muhammat Pazil ... [et al.]

    Shortest path from Bandar Tun Razak to Berjaya Times Square using Dijkstra Algorithm / Nur Syuhada Muhammat Pazil ... [et al.] by Muhammat Pazil, Nur Syuhada, Mahmud, Norwaziah, Jamaluddin, Siti Hafawati, Mustafa, Nur Farasyaqirra

    Published 2020
    “…Nevertheless, both time and cost of shortest path are constructed in different paths. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  2. 2
    The Development Of A Robust Algorithm For Uav Path Planning In 3d Environment

    The Development Of A Robust Algorithm For Uav Path Planning In 3d Environment by Kok, Kai Yit

    Published 2016
    “…Significant research has been conducted on Unmanned Aerial Vehicle (UAV) path planning using evolutionary algorithms, such as Particle Swarm Optimization (PSO), Genetic Algorithm (GA), Differential Evolution (DE), and Biogeographic-Based Optimization (BBO). …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  3. 3
    Comparative Study of Weighted Product–Dijkstra’s Algorithm and All Possible Path Approach Based on Multiple Criteria and Multi-Dimensions

    Comparative Study of Weighted Product–Dijkstra’s Algorithm and All Possible Path Approach Based on Multiple Criteria and Multi-Dimensions by Ting Kien Hua, Noraini Abdullah

    Published 2020
    “…Dijkstra’s algorithm was one of the shortest path algorithms that would be used to identify the path with the least cost. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  4. 4
    Path planning algorithm for a car like robot based on Coronoi Diagram Method

    Path planning algorithm for a car like robot based on Coronoi Diagram Method by Inun, Haidie

    Published 2013
    “…The algorithm is based on Voronoi diagram method for the environment representation combined with Dijkstra’s algorithm to find the shortest path. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  5. 5
    A generalized laser simulator algorithm for optimal path planning in constraints environment

    A generalized laser simulator algorithm for optimal path planning in constraints environment by Aisha, Muhammad

    Published 2022
    “…The suggested algorithm outperforms the competition in terms of improving path cost, smoothness, and search time. …”
    Get full text
    Thesis
    Save to List
    Saved in:
  6. 6
    Test case generation from state machine with OCL constraints using search-based techniques / Aneesa Ali Ali Saeed

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

    Published 2017
    “…A model-driven approach was used for generating abstract test cases from the feasible paths. This model driven approach was integrated with the proposed infeasible path detection method which based on analyzing various OCL constructs and operations. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  7. 7
    Integration of enchanced jump point search (JPS) algorithm with modified bresenham technique for path planning in virtual grid-based environment

    Integration of enchanced jump point search (JPS) algorithm with modified bresenham technique for path planning in virtual grid-based environment by Nurul Atikah Janis

    Published 2018
    “…The algorithm which consider the error value, e to increment pixels is the crucial part of the line generation applies the same concept in the second approach, where the error value, e is used as indicator to determine the heuristic cost of the path. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  8. 8
    Meta-Heuristic Algorithms for Learning Path Recommender at MOOC

    Meta-Heuristic Algorithms for Learning Path Recommender at MOOC by Son, N.T., Jaafar, J., Aziz, I.A., Anh, B.N.

    Published 2021
    “…Our model can generate an appropriate learning path for learners based on their background and job goals. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  9. 9
    RSA Encryption & Decryption using JAVA

    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
    Save to List
    Saved in:
  10. 10
    An application of Floyd-Warshall Algortihm in finding shortest path of order picker in warehouse / Saidatul Aisyah Roslan, Siti Norhakimah Mohd Yatim and Siti Sarah Sulaiman

    An application of Floyd-Warshall Algortihm in finding shortest path of order picker in warehouse / Saidatul Aisyah Roslan, Siti Norhakimah Mohd Yatim and Siti Sarah Sulaiman by Roslan, Saidatul Aisyah, Mohd Yatim, Siti Norhakimah, Sulaiman, Siti Sarah

    Published 2019
    “…For the result, shortest path for the order pickers in iterations. The algorithm used can help the order picker to have the shortest path, but it have no direct path. …”
    Get full text
    Get full text
    Student Project
    Save to List
    Saved in:
  11. 11
    Runtime reduction in optimal multi-query sampling-based motion planning

    Runtime reduction in optimal multi-query sampling-based motion planning by Khaksar W., Sahari K.S.B.M., Ismail F.B., Yousefi M., Ali M.A.

    Published 2023
    Conference Paper
    Save to List
    Saved in:
  12. 12
    Multi-drones energy efficient based path planning optimization using Genetic Algorithm and Gradient Decent approach

    Multi-drones energy efficient based path planning optimization using Genetic Algorithm and Gradient Decent approach by Mustafa, Yousra A, Ali, Elmustafa S, Osman, Thana E, Khalifa, Othman Omran, Mohamed, Zainb O, Saeed, Rashid A, Saeed, Mamoon M

    Published 2024
    “…The paper introduces an efficient energy optimization technique for multi-drones through path planning using Genetic Algorithm (GA) and Gradient Descent (GD). …”
    Get full text
    Get full text
    Get full text
    Get full text
    Proceeding Paper
    Save to List
    Saved in:
  13. 13
    Laser simulator: a novel search graph-based path planning approach

    Laser simulator: a novel search graph-based path planning approach by Ali, Mohammed A. H., Musa, Mailah

    Published 2018
    “…A novel technique called laser simulator approach for visibility search graph-based path planning has been developed in this article to determine the optimum collision-free path in unknown environment. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  14. 14
    An enhancement of path selection to cluster head based on multi-hop routing in two-tier wireless sensor network

    An enhancement of path selection to cluster head based on multi-hop routing in two-tier wireless sensor network by Wan Isni Sofiah, Wan Din, Asyran Zarizi, Abdullah, Razulaimi, Razali, Ahmad Firdaus, Zainal Abidin, Salwana, Mohamad, Eh Phon, Danakorn Nincarean, Cik Feresa, Mohd Foozy

    Published 2019
    “…It will determine the path based on a cost,in which the decision will be made depending on the lowest cost between several connected paths. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  15. 15
    On network flow problems with convex cost

    On network flow problems with convex cost by Nguyen, V.A., Tan, Y. P.

    Published 2004
    “…The proposed algorithm minimises the total cost of flow by incrementing the network flow along augmenting paths of minimum cost. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  16. 16
    Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer

    Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer by Ahmad Nezer, Nurul Aqilah

    Published 2017
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  17. 17
    Restaurant locator using Djikstra Algorithm / Mohamad Aliff Hakimi Lukman Hakim

    Restaurant locator using Djikstra Algorithm / Mohamad Aliff Hakimi Lukman Hakim by Lukman Hakim, Mohamad Aliff Hakimi

    Published 2017
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  18. 18
    Particle swarm optimization approach in route navigation for PoSVI-Cane

    Particle swarm optimization approach in route navigation for PoSVI-Cane by Toha, Siti Fauziah, Nordin, Nor Hidayati Diyana, Md. Zain, Mohd Zarhamdy

    Published 2023
    “…Here, Particle Swarm Optimization (PSO) path planning algorithm computes the shortest possible path based on the collection of coordinates along the pedestrian walkway. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  19. 19
    Ant colony optimization (ACO) algorithm for CNC route problem

    Ant colony optimization (ACO) algorithm for CNC route problem by Wan Nur Farhanah , Wan Zakaria

    Published 2012
    “…The GUT will be display the shortest path that should be taken by user and give user authority to manipulate the coordinate based on the requirement.…”
    Get full text
    Get full text
    Undergraduates Project Papers
    Save to List
    Saved in:
  20. 20
    UiTM Malaysia route planner / Mohamad Yunus Mohamed Nasir

    UiTM Malaysia route planner / Mohamad Yunus Mohamed Nasir by Mohamed Nasir, Mohamad Yunus

    Published 2008
    “…The shortest route is most appropriate than others because it can save time, cost and effort. The Route Planner's core is Dijkstra's shortest-path-finding algorithm, with extensions for time dependent delays and paths constrained by travel mode. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:

Search Tools: