Search Results - (( java implementation path algorithm ) OR ( using choice using algorithm ))
Search alternatives:
- java implementation »
- implementation path »
- using algorithm »
- path algorithm »
- using choice »
- choice using »
-
1
Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer
Published 2017“…The development tools used in developing this project is NetBeans by using Java for the implementation of the coding. The methodology that used for developing this system is the Dijkstra’s algorithm. …”
Get full text
Get full text
Thesis -
2
Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization
Published 2019“…BST inserts the nodes in the way that the Dijkstra’s can find the empty parking in fastest way. Dijkstra’s algorithm initials the paths to finding the shortest path while ACO optimizes the paths. …”
Get full text
Get full text
Thesis -
3
Path planning for unmanned aerial vehicle (UAV) using rotated accelerated method in static outdoor environment
Published 2021“…In this study, a fast iterative method known as Rotated Successive Over-Relaxation (RSOR) is introduced. The algorithm is implemented in a self-developed 2D Java tool, UAV Planner. …”
Get full text
Get full text
Get full text
Get full text
Article -
4
Smart appointment organizer for mobile application / Mohd Syafiq Adam
Published 2009“…The main component of this prototype is the use of Dijkstra algorithm to compute the shortest path from source of appointment to the 6 points of destinations within UiTM Shah Alam. …”
Get full text
Get full text
Thesis -
5
A decision support system using Neurofuzzy algorithm methods in selecting lecturer's teaching work load for bachelor in multimedia / Asmaa Musa
Published 2007“…A large nimiber of techniques, such as Neurofuzzy algorithm methods are used to produce an efficient and effective system. …”
Get full text
Get full text
Thesis -
6
Simulation algorithm of bayesian approach for choice-conjoint model
Published 2011“…Generally in Choice-Conjoint method the Multinomial Logit Model (MNL) is normally used to analyze choice conjoint data, but the MNL has some serious limitations. …”
Get full text
Thesis -
7
An alternative approach to normal parameter reduction algorithms for decision making using a soft set theory / Sani Danjuma
Published 2017“…Many normal parameter reduction algorithms exist to handle parameter reduction and maintain consistency of decision choices. …”
Get full text
Get full text
Get full text
Thesis -
8
-
9
-
10
Simulation of fast recursive least square algorithm for echo cancellation system
Published 2003“…The performance of echo canceller depends on the choice of the adaptive filtering using Fast Recursive Least Square (FRLS) algorithm. …”
Get full text
Get full text
Student Project -
11
Tap setting transformer for loss minimization using genetic algorithm / Mazyudin Mokhtar
Published 2007“…This paper presents an alternative approach to the use of load flow by incorporation Genetic Algorithm (GA) to search the optimal transformer tap setting in order to minimize losses. …”
Get full text
Get full text
Thesis -
12
CPU Burst Processes Prioritization Using Priority Dynamic Quantum Time Algorithm: A Comparison with Varying Time Quantum and Round Robin Algorithms
Published 2015“…Round Robin scheduling algorithm is the most suitable choice for time shared system but not for soft real time systems due to a large turnaround time, large waiting time and high number of context switches. …”
Get full text
Get full text
Get full text
Article -
13
Application of the Genetic Algorithms (GAs) in determining the optimal transformer tap setting for loss minimization using MATLAB / Mohd Syful Adly Abd. Wahab
Published 2003“…In this way , the choice of the transformer tap setting can be determined whilst minimising losses and at the same time improved the voltage profile in the power system The performance of this Genetic Algorithms technique was tested using standard IEEE 6-bus system and analysis of results is presented.…”
Get full text
Get full text
Thesis -
14
Inversion Of Surface Wave Phase Velocity Using New Genetic Algorithm Technique For Geotechnical Site Investigation
Published 2011“…The inverse procedure of surface wave phase velocity is a complicated problem for linear inversion approach because of its multi-model and highly nonlinear nature. Therefore the use of genetic algorithm (GA) optimization technique which is one of nonlinear optimization methods is an appropriate choice to solve surface wave inversion problem having high nonlinearity and multimodality. …”
Get full text
Get full text
Thesis -
15
Optimize the maximum flow of electricity capacity using Ford Fulkerson, Edmonds Karp and Goldberg Tarjan algorithm / Nik Nur Diyana Nik Mohd Huzaidi
Published 2024“…This research explores the optimization of electricity flow using the Ford Fulkerson, Edmonds Karp, and Goldberg Tarjan algorithms. …”
Get full text
Get full text
Thesis -
16
Separator Database and SPM Tree Framework for Mining Sequential Patterns Using Prefixspan with Pseudoprojection
Published 2008“…This novel approacho for integrating separator Database and Framework using these choices of Java collections outperforms with pseudoprojectionin terms of CPU performance and memory. …”
Get full text
Thesis -
17
Obstacle Avoidance System in Underwater Glider
Published 2017“…While Bug algorithm is had been used in underwater vehicles, A* algorithm are more commonly used in ground robots. …”
Get full text
Get full text
Final Year Project -
18
Accelerating graph algorithms with priority queue processor
Published 2006“…In this work, we demonstrate how to accelerate graph algorithms using priority queue processor. DijkstraÂ’s algorithm is chosen as the target implementation, as many state-of-the-art graph algorithms use DijkstraÂ’s algorithm at the heart of their computational engine. …”
Get full text
Get full text
Article -
19
-
20
On damping parameters of Levenberg-Marquardt algorithm for nonlinear least square problems
Published 2021“…The Levenberg-Marquardt (LM) algorithm is a widely used method for solving problems related to nonlinear least squares. …”
Get full text
Get full text
Conference or Workshop Item
