Search Results - (( java implementation path algorithm ) OR ( programming using dan algorithm ))
Search alternatives:
- java implementation »
- implementation path »
- path algorithm »
- dan algorithm »
- using dan »
-
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
-
6
-
7
Design Of Robot Motion Planning Algorithm For Wall Following Robot
Published 2006Get full text
Get full text
Monograph -
8
Parallelization Of CCSDS Hyperspectral Image Compression Using C++
Published 2018Get full text
Get full text
Monograph -
9
Evolutionary cost-cognizant regression test case prioritization for object-oriented programs
Published 2019“…Therefore, this study proposed a cost-cognizant TCP approach for object-oriented software that uses path-based integration testing to identify the possible execution path extracted from the Java System Dependence Graph (JSDG) model of the source code using forward slicing technique. …”
Get full text
Get full text
Thesis -
10
Development of decentralized data fusion algorithm with optimized kalman filter.
Published 2016“…The model collaborates data fusion technology with algorithm engineering domain, accordingly data fusion algorithm is optimized using sophisticated technique such as functional programming to reduce the processing delay and memory usage. …”
Get full text
Get full text
Thesis -
11
-
12
The Development And Evaluation Of Personalized Learning Material Based On A Profiling Algorithm For Polytechnic Students In Learning Algebra
Published 2016“…The recommendation is computed using a Case-based Reasoning (CBR) algorithm by finding the similarity between the new submitted profile and the stored profiles in the database. …”
Get full text
Get full text
Thesis -
13
Predictive Analytics in Genetic Engineering as an Optimization Problem
Published 2024“…Such predictive analytics information is useful for guiding decision-making by researchers and breeders in the crop improvement program.…”
Get full text
Get full text
Get full text
Article -
14
-
15
Implementation Of Hardware Software Partitioning In Embedded System
Published 2018Get full text
Get full text
Monograph -
16
-
17
Pengurusan rantaian bekalan menggunakan MRP dan DRP di FAMA
Published 2005Get full text
Get full text
Thesis -
18
Hardware Acceleration of Window Big-Digit (Wbd) Multiplication for Embedded Applications
Published 2015“…Hence, wBD number system could be an excellent candidate to speed up overall multiplication process. The wBD algorithm has been analyzed and benchmarked against other multiplication methods in algorithmic level. …”
Get full text
Get full text
Thesis -
19
-
20
Filtered Distance Matrix For Constructing High-Throughput Multiple Sequence Alignment On Protein Data
Published 2015“…Optimal MSA is an NP-hard problem, while building optimal alignment using dynamic programming is an NP complete problem. …”
Get full text
Get full text
Thesis
