Search Results - optimal ((((cloud algorithm) OR (((graph algorithm) OR (path algorithm))))) OR (based algorithm))
Search alternatives:
- cloud algorithm »
- graph algorithm »
- path algorithm »
-
1
Guidance system based on Dijkstra-ant colony algorithm with binary search tree for indoor parking system
Published 2021“…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
Article -
2
Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator: article
Published 2010“…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
Article -
3
Autonomous mobile robots path planning with integrative edge cloud-based ant colony optimization
Published 2025“…To address these challenges, this study proposes an Integrative Edge Cloud-Based Ant Colony Optimization (IECACO) algorithm. …”
Get full text
Get full text
Get full text
Get full text
Article -
4
African Buffalo Optimization (ABO): A New Metaheuristic Algorithm
Published 2015“…The African Buffalo Optimization (A.B.0) algorithm simulates the African buffalos' behaviour by encapsulation in a mathematical model; which solves a number of discrete optimization problems using graph-based route planning, job scheduling and it extends Swarm Intelligence paradigms. …”
Get full text
Get full text
Get full text
Article -
5
Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator
Published 2010“…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
Student Project -
6
Synthesis of transistor chaining algorithm for CMOS cell layout using euler path / Sukri Hanafiah
Published 1997“…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
Thesis -
7
Synthesis of transistor-chaining algorithm for CMOS cell layout using bipartite graph / Azizi Misnan
Published 1997“…Searching for possible abutment between the transistor pairs are modelled as a bipartite graph. A depth - first search algorithm is used to search for optimal chaining. …”
Get full text
Get full text
Thesis -
8
High Rise Building Evacuation Route Model Using DIJKSTRA'S Algorithm
Published 2015“…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
Thesis -
9
Optimization of mobile robot path planning in semi-dynamic environment using genetic algorithm
Published 2023“…The environment design is based on a 2-D coordinated graph with irregular shapes as the semi-dynamic obstacle and by restructuring the genes to plan a robot path. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
10
Attack path selection optimization with adaptive genetic algorithms
Published 2016“…We describe our approach for implementing an optimized security assessment using Genetic Algorithm (GA). …”
Get full text
Get full text
Article -
11
Attack path selection optimization with adaptive genetic algorithms
Published 2016“…We describe our approach for implementing an optimized security assessment using Genetic Algorithm (GA). …”
Get full text
Get full text
Article -
12
Path planning algorithm for a car-like robot based on cell decomposition method
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 -
13
AUTOMATIC ROUTE FINDER FOR NEW VISITORS
Published 2006“…This study is based on Dijkstra's algorithm as the algorithm finds the most effective way to traverse an entire graph. …”
Get full text
Get full text
Final Year Project -
14
Development of deep reinforcement learning based resource allocation techniques in cloud radio access network
Published 2022“…The first proposed algorithm aims to optimize the EE by controlling the on/off status of RRH via a deep Q network (DQN) and subsequently solving a power optimization problem. …”
Get full text
Get full text
Final Year Project / Dissertation / Thesis -
15
-
16
Path Optimization For Cooperative Multi-Head 3d Printing
Published 2020“…Hence, finding the best path for the nozzle is termed as the Layer Path Optimization Problem (LPOP). …”
Get full text
Get full text
Final Year Project / Dissertation / Thesis -
17
Task offloading paradigm in mobile edge computing-current issues, adopted approaches, and future directions
Published 2023“…Due to the high diversity of research areas, targeted issues, and adopted algorithms and techniques, finding the right research path in task offloading is highly demanding. …”
Get full text
Get full text
Article -
18
Route optimization using shortest path method / Muhamad Faisal Amin Shakri
Published 2025“…Each algorithm was tested to compute the shortest path, with results indicating that while all algorithms arrive at the same optimal route, their efficiency differs. …”
Get full text
Get full text
Thesis -
19
Implementation of locust inspired scheduling algorithm with huge number of servers for energy efficiency in a cloud datacenter
Published 2019“…It does not consider the LACE algorithm implemented in huge number of server in one Cloud datacenter. …”
Get full text
Get full text
Thesis -
20
Design of DNA fragment assembly using IWP method on application-specific integrated-circuit / Hasniliati Hassan
Published 2017“…After reviewing various algorithms, it was decided to apply de Bruijn graphs and Eulerian circuits that are based on graph theory. …”
Get full text
Get full text
Thesis
