Search Results - been ((graph algorithm) OR (((path algorithm) OR (bat algorithm))))

Search alternatives:

Refine Results
  1. 1
    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:
  2. 2
    IMPLEMENTATION OF GRAPH BASED PATH PLANNING ALGORITHMS FOR INDOOR NAVIGATION

    IMPLEMENTATION OF GRAPH BASED PATH PLANNING ALGORITHMS FOR INDOOR NAVIGATION by SYED KHAIZURA, SYED HUSEIN KAMIL

    Published 2018
    “…In which the obstacles, start node and target node will be known in advance of starting the path planning algorithms. Based on the results of MATLAB simulation, the A* algorithm is the best algorithm in finding the shortest path with the least time taken. …”
    Get full text
    Get full text
    Final Year Project
    Save to List
    Saved in:
  3. 3
    Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator: article

    Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator: article by Othman, Nor Shuhaida

    Published 2010
    “…The scope of the paper based on optimal path trace back using graph theory. The kind of graph theory that been used was indirected graph with linear algebra. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  4. 4
    Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator

    Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator by Othman, Nor Shuhaida

    Published 2010
    “…The scope of the paper based on optimal path trace back using graph theory. The kind of graph theory that been used was indirected graph with linear algebra. …”
    Get full text
    Get full text
    Student Project
    Save to List
    Saved in:
  5. 5
    A hybrid algorithm for finding shortest path in network routing.

    A hybrid algorithm for finding shortest path in network routing. by Soltan Aghaei, Mohammad Reza, Ahmad Zulkarnain, Zuriati, Mamat, Ali, Zainuddin, Hishamuddin

    Published 2009
    “…This wave gives an O( N ) steps quantum algorithm for identifying that record, where was used classical Dijkstra’s algorithm for finding shortest path problem in the graph of network and implement quantum search. …”
    Get full text
    Article
    Save to List
    Saved in:
  6. 6
    Implementation of Graph Based Path Planning Algorithms on a Mobile Robot in a Confined Site

    Implementation of Graph Based Path Planning Algorithms on a Mobile Robot in a Confined Site by TANG, HON PANN

    Published 2017
    “…This project investigates the performance of three different graph based path planning algorithms used, relaxed A*, A* and Dijkstra’s algorithm in a few environments with different obstacles settings using Gazebo environment simulator and Turtlebot simulator (computer simulation) and 4WD navigation robot (real environment simulation).…”
    Get full text
    Get full text
    Final Year Project
    Save to List
    Saved in:
  7. 7
    Path Optimization For Cooperative Multi-Head 3d Printing

    Path Optimization For Cooperative Multi-Head 3d Printing by Cheong, Kah Jun

    Published 2020
    “…These two proposed algorithms have been modified from the original algorithms in order to solve the URPP instead of the TSP. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
    Save to List
    Saved in:
  8. 8
    FROM IMAGE TO GRAPH-BASED DATA FOR PATH PLANNING

    FROM IMAGE TO GRAPH-BASED DATA FOR PATH PLANNING by MOHAMAD YATIM, NOOR AMANINA HANISAH

    Published 2019
    “…This implementation of graph traversal, statistics and machine learning algorithms were a challenging part to be done. …”
    Get full text
    Get full text
    Final Year Project
    Save to List
    Saved in:
  9. 9
    Guidance system based on Dijkstra-ant colony algorithm with binary search tree for indoor parking system

    Guidance system based on Dijkstra-ant colony algorithm with binary search tree for indoor parking system by Mohammad Ata, Karimeh Ibrahim, Che Soh, Azura, Ishak, Asnor Juraiza, Jaafar, Haslina

    Published 2021
    “…BST has been used to store the paths that Dijkstra algorithm initialled. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  10. 10
    Computationally-efficient path planning algorithms in obstacle-rich environments based on visibility graph method

    Computationally-efficient path planning algorithms in obstacle-rich environments based on visibility graph method by Abdul Latip, Nor Badariyah

    Published 2018
    “…It is one of the vital aspects in enhancing an autonomy of a robot. Cun·ent studies have been focused on developing path planning algorithms to satisfy the criteria of path planning namely minimum path length, low computation time and complete, i.e., it gives positive result if a path is available or negative if otherwise. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  11. 11
    Bat Algorithm for Complex Event Pattern Detection in Sentiment Analysis

    Bat Algorithm for Complex Event Pattern Detection in Sentiment Analysis by Kabir Ahmad, Farzana, Kamaruddin, Siti Sakira, Yusof, Yuhanis, Yusoff, Nooraini

    Published 2021
    “…This algorithm mainly based on the echolocation behavior of bats. …”
    Get full text
    Get full text
    Monograph
    Save to List
    Saved in:
  12. 12
    Path planning algorithm for a car-like robot based on cell decomposition method

    Path planning algorithm for a car-like robot based on cell decomposition method by Omar, Nurhanum

    Published 2013
    “…Then, the connectivity graph is created followed by calculating the shortest path by Dijkstra’s algorithm. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  13. 13
    Attack graph construction for enhancing intrusion prediction based on vulnerabilities metrics

    Attack graph construction for enhancing intrusion prediction based on vulnerabilities metrics by Al-Araji, Zaid Jasim Mohammed

    Published 2023
    “…This study employs use Random Forest algorithm to identify and forecast attacks to dynamically locate the attack location in the network for attack graph analysis. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  14. 14
    An Experiment of Ant Algorithms : Case Study of Kota Kinabalu Central Town

    An Experiment of Ant Algorithms : Case Study of Kota Kinabalu Central Town by Nor Rafidah, Mohamad

    Published 2005
    “…There are many algorithms that used to solve this problem. In this study, ant algorithms are used to find the shortest path using a real data. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  15. 15
    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:
  16. 16
    Path planning for unmanned aerial vehicles using visibility line-based methods

    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
    Save to List
    Saved in:
  17. 17
    Test case minimization applying firefly algorithm

    Test case minimization applying firefly algorithm by Hashim, Nor Laily, Dawood, Yasir Salman

    Published 2018
    “…The proposed test case minimization method has the following steps: provide weight to the paths, calculate path coverage for each path, transform an immediate graph into an adjacency matrix, which later is used to apply firefly algorithm and generate optimal test cases. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  18. 18
    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:
  19. 19
    Evaluation of Visual Network Algorithms on Historical Documents

    Evaluation of Visual Network Algorithms on Historical Documents by Khairunnisa, Binti Ibrahim

    Published 2020
    “…The framework has been used to evaluate three graph layout and three graph clustering algorithms on the historical SAGA dataset. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  20. 20
    An improved algorithm in test case generation from UML activity diagram using activity path

    An improved algorithm in test case generation from UML activity diagram using activity path by Hashim, Nor Laily, Salman, Yasir D.

    Published 2011
    “…This paper proposed an improved algorithm to automatically generate test cases directly from UML activity diagram using an activity graph.This algorithm has been implemented as a prototype using UML activity diagrams as inputs to generate test cases.These generated test cases are generated automatically are compared to test cases that are generated manually in order to evaluate the algorithm’s usability and reliability.The result shows that the test cases generated by the developed test case generator program are the same as the one manually derived.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:

Search Tools: