Search Results - ((((((graph algorithm) OR (path algorithm))) OR (tree algorithm))) OR (based algorithm))

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

“…This solution depending on applying the optimization on an optimal path while the traditional ACO is optimizing the random path based on the greedy algorithm hence we get the most optimal path. …”
Get full text
Get full text
Get full text

Synthesis of transistor-chaining algorithm for CMOS cell layout using bipartite graph / Azizi Misnan by Misnan, Azizi

“…The result will be compared with euler's path algorithm using heuristic search and a pseudo input to find the minimum interlace.…”
Get full text
Get full text

Quantum Processing Framework And Hybrid Algorithms For Routing Problems by Soltan Aghaei, Mohammad Reza

“…Another quantum algorithm for a minimum weight spanning tree in the graph was also designed. …”
Get full text
Get full text

Synthesis of transistor chaining algorithm for CMOS cell layout using bipartite graph / Azizi Misnan by Misnan, Azizi

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

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

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

“…Classical algorithms have been used to search over some space for finding the shortest paths problem between two points in a network and a minimal weight spanning tree for routing. …”
Get full text

Nano-scale VLSI clock routing module based on useful-skew tree algorithm by Eik Wee, Chew, Heng Sun, Ch'ng, Shaikh-Husin, Nasir, Hani, Mohamed Khalil

“…We implemented Useful-Skew Tree (UST) algorithm which is based on the deferred-merge embedding (DME) paradigm, as the clock layout synthesis engine. …”
Get full text
Get full text

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

“…In this study, we are looking at the performance of four graph-based path planning algorithms which is Breadth First Search, Depth First Search, Dijkstra and A*, when implemented in real world applications. …”
Get full text
Get full text

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

Spanning Tree Transformation of Connected Graph into Single-Row Network by Loh, Ser Lee, Salleh, Shaharuddin, Sarmin, Nor Haniza

“…Path-Growing Tree-Forming algorithm applied with Vertex-Prioritized is contained in the model to produce the spanning tree from the connected graph. …”
Get full text
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

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

“…The Smith-Waterman is been simplified into four modules which were initialization, score calculation, matrix filling and optimal path. The scope of the paper based on optimal path trace back using graph theory. …”
Get full text
Get full text

Predicting future sales using genetic algorithm: data mining sales / Siti Hajar Yaacob by Yaacob, Siti Hajar

“…Besides that, Genetic Algorithm is applying to predict future sales based on the sales and product data. …”
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 Smith-Waterman is been simplified into four modules which were initialization, score calculation, matrix filling and optimal path. The scope of the paper based on optimal path trace back using graph theory. …”
Get full text
Get full text

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

“…This thesis concerns the development of path planning algorithms for unmanned aerial vehicles (UAVs) to avoid obstacles in two- (2D) and three-dimensional (3D) urban environments based on the visibility graph (VG) method. …”
Get full text
Get full text

African Buffalo Optimization (ABO): A New Metaheuristic Algorithm by Odili, Julius Beneoluchi, M. N. M., Kahar

“…This paper proposes a new meta-heuristic approach to solving numerical and graph-based problems. The African buffalo algorithm evolved from an understanding of the animal's survival instincts and the search techniques they utilize in the African forests and savannahs; the search for the optimal path to pasture is aligned to their cooperative, intelligent, and social nature. …”
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

High Rise Building Evacuation Route Model Using DIJKSTRA'S Algorithm by Mohd Sabri, Nor Amalina

“…The information then is used to generate a directed graph in order to obtain the shortest path results through the implementation of shortest path algorithm. …”
Get full text
Get full text
Get full text
Get full text

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

“…There’s varies approach to be used for path planning and one of the approaches that will be discuss in this report which is a study of graph-based data from an image of a maze-solving path project. …”
Get full text
Get full text

Synthesis of transistor chaining algorithm for CMOS cell layout using euler path / Sukri Hanafiah by Hanafiah, Sukri

“…The comparison between euler's path and Bipartite graph Algorithm [14] will be made at the end this of this report to see which one give optimal chaining .…”
Get full text
Get full text