Search Results - (( java implementation among algorithm ) OR ( using execution path algorithm ))

Search alternatives:

Refine Results
  1. 1
    New algorithm for autonomous dynamic path planning in real-time intelligent robot car

    New algorithm for autonomous dynamic path planning in real-time intelligent robot car by Mohammed, Akeel Ahmed, Hassan, Mohd Khair, Aris, Ishak, Kamsani, Noor Ain

    Published 2017
    “…Different algorithms have been used to address this problem by considering the optimal path with minimum cost; however, these algorithms did not consider the execution time to find such path. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  2. 2
    Optimal QoS aware multiple paths web service composition using heuristic algorithms and data mining techniques

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

    Published 2014
    “…This mechanism is performed in two steps. First, the runtime path prediction method predicts, at runtime, and just before the actual composition, execution, the execution path that will potentially be executed. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  3. 3
    Ambulance shortest path problem by using link-based algorithm

    Ambulance shortest path problem by using link-based algorithm by Lee, Chooi Hua

    Published 2015
    Get full text
    Get full text
    Academic Exercise
    Save to List
    Saved in:
  4. 4
    Modelling of multi-robot system for search and rescue

    Modelling of multi-robot system for search and rescue by Poy, Yi Ler

    Published 2023
    “…It was found that the number of populations set to 75 and dynamically adjusts the value of inertial weight, the cognitive and social parameter provides the best performance in terms of shortest path length and execution time. In conclusion, this project shows that the MPSO algorithm is capable of generating a better path compared to the normal PSO algorithm in terms of average path length and execution time, making it a promising algorithm for multi-robot path planning in dynamic environments.…”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
    Save to List
    Saved in:
  5. 5
    Plagiarism Detection System for Java Programming Assignments by Using Greedy String-Tilling Algorithm

    Plagiarism Detection System for Java Programming Assignments by Using Greedy String-Tilling Algorithm by Norulazmi, Kasim

    Published 2008
    “…The prototype system, known as Java Plagiarism Detection System (JPDS) implements the Greedy-String-Tiling algorithm to detect similarities among tokens in a Java source code files. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  6. 6
    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
    “…For example, in the last experiment part of using general height map, the execution time is 10ms with shortest path of 91 node distance compared to Original JPS with 40ms and 122 node distance. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  7. 7
    Automated path testing using the negative selection algorithm

    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
    Save to List
    Saved in:
  8. 8
    Optimised multi-robot path planning via smooth trajectory generation

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

    Published 2024
    “…A MPSO algorithm, without path smoothening, is used for comparison. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
    Save to List
    Saved in:
  9. 9
    Optimal path planning algorithms in virtual environments

    Optimal path planning algorithms in virtual environments by Hassan, Rohayanti

    Published 2006
    “…In relation to that, A* algorithm was used as a path finding technique to plan a collision-free-path journey from one location to another. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  10. 10
    Direct approach for mining association rules from structured XML data

    Direct approach for mining association rules from structured XML data by Abazeed, Ashraf Riad

    Published 2012
    “…The thesis also provides a two different implementation of the modified FLEX algorithm using a java based parsers and XQuery implementation. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  11. 11
    Performance analysis of genetic algorithm (GA)-based multi-constrained path routing algorithm

    Performance analysis of genetic algorithm (GA)-based multi-constrained path routing algorithm by Yussof S.

    Published 2023
    “…The performance of the algorithm is then compared with an exact algorithm called the depth first search and a common shortest path algorithm called the Dijkstra's algorithm. …”
    Article
    Save to List
    Saved in:
  12. 12
    A hybrid sampling-based path planning algorithm for mobile robot navigation in unknown environments

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

    Published 2013
    “…These algorithms generate paths using random numbers and perform efficiently in guiding the robot in known environments. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  13. 13
    A comparative study on ant-colony algorithm and genetic algorithm for mobile robot planning.

    A comparative study on ant-colony algorithm and genetic algorithm for mobile robot planning. by Rajendran, Piraviendran, Othman, Muhaini

    Published 2024
    “…For case study 2, the ACO algorithm achieved a best distance of 1071 (u) with execution time 1.91 (s), while the GA algorithm resulted in a best distance of 1082 (u) with execution time 0.08 (s). …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  14. 14
    Graph processing hardware accelerator for shortest path algorithms in nanometer very large-scale integration interconnect routing

    Graph processing hardware accelerator for shortest path algorithms in nanometer very large-scale integration interconnect routing by Ch'ng, Heng Sun

    Published 2007
    “…It has been shown that the performance of a graph-based shortest path algorithm can severely be affected by the performance of its priority queue. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  15. 15
    A Toolkit for Simulation of Desktop Grid Environment

    A Toolkit for Simulation of Desktop Grid Environment by FOROUSHAN, PAYAM CHINI

    Published 2014
    “…A simulator for desktop grid environment has been developed using Java as the implementation language due to its wide popularity. …”
    Get full text
    Get full text
    Final Year Project
    Save to List
    Saved in:
  16. 16
    A review on autonomous mobile robot path planning algorithms

    A review on autonomous mobile robot path planning algorithms by Noraziah, Adzhar, Yuhani, Yusof, Muhammad Azrin, Ahmad

    Published 2020
    “…The emerging trend of modern industry automation requires intelligence to be embedded into mobile robot for ensuring optimal or near-optimal solutions to execute certain task. This yield to a lot of improvement and suggestions in many areas related to mobile robot such as path planning. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  17. 17
    Development of robust control scheme for wheeled mobile robot in restricted environment

    Development of robust control scheme for wheeled mobile robot in restricted environment by Muhammad Sawal, A Radzak

    Published 2021
    “…A novel algorithm so called laser simulator logic (LSL) has been develo ped to estimate the inertia moment when the environment is noisy and cannot use fuzzy logic algorithm. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  18. 18
    Autonomous mobile robots path planning with integrative edge cloud-based ant colony optimization

    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
    Save to List
    Saved in:
  19. 19
    Ant colony algorithm for text classification in multicore-multithread environment / Ahmad Nazmi Fadzal

    Ant colony algorithm for text classification in multicore-multithread environment / Ahmad Nazmi Fadzal by Fadzal, Ahmad Nazmi

    Published 2017
    “…Based on the concept, pheromone saturation is used to combine stackable solution pattern that is discovered while straying to different term node to build a path. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  20. 20
    Energy efficient path-planning for unmanned aerial vehicle

    Energy efficient path-planning for unmanned aerial vehicle by Debnath, Sanjoy Kumar

    Published 2022
    “…The proposed path planning algorithm is called Iterative Elliptical- Convex Visibility Graph (IECoVG) which is based on visibility graph (VG) and Dijkstra’s algorithm. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:

Search Tools: