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

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

“…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

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

“…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

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

“…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

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

“…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

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

“…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

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

“…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

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

“…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

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

“…This implementation of graph traversal, statistics and machine learning algorithms were a challenging part to be done. …”
Get full text
Get full text

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

“…BST has been used to store the paths that Dijkstra algorithm initialled. …”
Get full text
Get full text
Get full text

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

“…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

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

“…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

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

“…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

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

“…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

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

“…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

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

“…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

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

“…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

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

“…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

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

“…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

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

“…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

Using graph algorithm and classification technique for finding an optimal bus route in time-dependent travel times by Deelertmongkolchai, Satjayod, Chumwatana, Todsanai, Thaiupathump, Choonhapong

“…However, they are suffering from the long hours in traffic jam especially in rush hour.They also cannot avoid this such jam as bus routes are fixed by Bangkok Mass Transit Authority (BMTA).This paper aims to propose a technique for finding an Optimal Bus Route in Time-Dependent Travel Times by using graph algorithm and data mining technique. The proposed technique is able to find a least spent travel time path between two nodes in a bus network with time-dependence.Graph algorithm is used to generate all possible paths to reveal the distances.Classification technique is then used to analysis traffic situation in different period of the time.By analysis traffic situation, date, time, week, month, location are used as a main factor for training process in classification technique.From the experimental studies, the proposed technique is able to show the best route from any given node to the final destination depending on the different period of the time.The proposed technique provides significant benefit for traveler to select the best bus route, which is short distance and fast, among generated routes…”
Get full text
Get full text
Get full text