Search Results - (( java implication based algorithm ) OR ( value implementation path algorithm ))
Search alternatives:
- value implementation »
- implementation path »
- implication based »
- java implication »
- path algorithm »
-
1
Analysis of Dijkstra’s and A* algorithm to find the shortest path
Published 2015“…There are so many algorithms used to find the shortest path such as Dijkstra, A* algorithm, Genetic algorithm, Floyd algorithm and Ant algorithm. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
2
Simulation of shortest path using a-star algorithm / Nurul Hani Nortaja
Published 2004“…This means A • algorithm only calculates and consider the next node m path that has the lowest value of G and F, plus searching the shortest route by using heuristic estimation in Manhattan method. …”
Get full text
Get full text
Thesis -
3
Design of radix-4 single path delay fast fourier transform processor with genetic algorithms optimization
Published 2011“…This research work involves the implementation of Single Objective Genetic Algorithm (SOGA) and Multi-objectives Genetic Algorithm (MOGA) in a 16-point Radix-4 Single Path Delay Feedback (R4SDF) pipelined Fast Fourier Transform (FFT) processor. …”
Get full text
Get full text
Thesis -
4
Route optimization using shortest path method / Muhamad Faisal Amin Shakri
Published 2025“…This study investigated the implementation and comparison between well known shortest path method which are Dijkstra’s algorithm, Bellman-Ford, and A* algorithm. …”
Get full text
Get full text
Thesis -
5
Indoor navigation system using Dijkstra’s algorithm for emergency situation: article / Mohd Faizulhayad Mashuri
Published 2015“…Bigger obstacles will gives higher value of weight. Route planning using Dijkstra’s algorithm can produce better accuracy and more reliable in indoor environment since the only factor taken into account is the weight for each path.…”
Get full text
Get full text
Article -
6
Indoor navigation system using Dijkstra's algorithm for emergency situation / Mohd Faizulhayad Mashuri
Published 2015“…Bigger obstacles will gives higher value of weight. Dijkstra's algorithm can provide shortest route to be used by user in a fast manner due to its medium algorithm complexity compared to the other two (2) algorithms. …”
Get full text
Get full text
Thesis -
7
Localization using fingerprint method in emergency situation for indoor navigation system / Felix Ceilomond Samam
Published 2015“…Bigger obstacles will gives higher value of weight. Route planning using Dijkstra's algorithm can produce better accuracy and more reliable in indoor environment since the only factor taken into account is the weight for each path.…”
Get full text
Get full text
Thesis -
8
A generalized laser simulator algorithm for optimal path planning in constraints environment
Published 2022“…The suggested algorithm outperforms the competition in terms of improving path cost, smoothness, and search time. …”
Get full text
Thesis -
9
Development of low power viterbi decoder on complex programmable logic device platform
Published 2018“…For the path metric updater unit (PMU), the traditional method of Viterbi algorithm is to store the selected minimum value of branch metric in the memory unit. …”
Get full text
Get full text
Get full text
Thesis -
10
An enhancement of path selection to cluster head based on multi-hop routing in two-tier wireless sensor network
Published 2019“…The element of Shortest Path First (SPF) Algorithm that is used in a routing protocol will be implemented. …”
Get full text
Get full text
Get full text
Get full text
Article -
11
Implementation of Cognitive Mapping Algorithm for Robot Navigation System
Published 2014“…Robot will be given some algorithm for certain task. In this project, we are going to build the cognitive mapping algorithm that can be implemented to the mobile robot. …”
Get full text
Get full text
Get full text
Proceeding Paper -
12
Modelling Autonomous Evacuation Navigation System (AENS) for optimal route using Dijkstra's algorithm
Published 2016“…Through ST adaptation, all subsystems were integrated and using the “Dijkstra’s algorithm” (DA) by modifying its function from shortest path algorithm to safest and shortest algorithm, to the nearest exit. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
13
Development of Path Loss Models for Smooth and Convex Surfaces Terrains in Malaysian Environment
Published 2004“…An integrated UPMPL path loss model for both smooth and convex surfaces terrains has been developed and implemented using Agilent VEE. …”
Get full text
Get full text
Thesis -
14
The solution of 2048 puzzle game using A* algorithm / Zafhira Ismail
Published 2017“…The input data of this project is retrieved from the game’s rule itself and implemented with the proposed algorithm which is A* algorithm. …”
Get full text
Get full text
Thesis -
15
Optimum Time-Cost Trade-Off Strategies on Critical Path Method for Project Management
Published 2010“…Crashing in CPM means crashing one time unit from critical activity that has smallest cost slope while ensuring that the critical path is still the longest path in the project network. …”
Get full text
Get full text
Thesis -
16
Robot path planning using family of SOR iterative methods with laplacian behaviour-based control
Published 2015“…This study proposed a robot path planning technique that relies on the use of Laplace's equation to constrain the generation of potential values. …”
Get full text
Get full text
Get full text
Thesis -
17
Reliability performance evaluation and integration of routing algorithm in shuffle exchange with minus one stage
Published 2012“…In addition this thesis also incorporates integration of routing algorithm to the SENs architecture. Several routing algorithm derived by past researches are also implemented for comparison purposed. …”
Get full text
Get full text
Thesis -
18
Design of self-tuning minimum effort active noise control with feedback inclusion architecture
Published 2009“…The controller design and implementation are evaluated in terms of the level of cancellation at the observer through simulation studies for various values of modified effort weighting parameter in the range ⩽0γ⩽1. …”
Get full text
Get full text
Get full text
Article -
19
-
20
Analysis of robot localisation performance based on extended kalman filter
Published 2015“…This project is implemented based on the existing localisation algorithm [30]. …”
Get full text
Get full text
Get full text
Get full text
Thesis