Search Results - (( java implementation path algorithm ) OR ( using sparse tree algorithm ))
Search alternatives:
- java implementation »
- implementation path »
- path algorithm »
- tree algorithm »
- using sparse »
- sparse tree »
-
1
Prime-based method for interactive mining of frequent patterns
Published 2010“…Since rerunning the mining algorithms from scratch can be very time consuming, researchers have introduced interactive mining to find proper patterns by using the current mining model with various minsup. …”
Get full text
Get full text
Thesis -
2
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 -
3
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 -
4
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 -
5
Hardware development of autonomous mobile robot based on actuating lidar
Published 2022“…From here, the extracted values are implied on k-NN, Decision Tree and CNN training algorithm. The final result shows promising potential with 91% prediction when implemented on the Decision Tree algorithm based on our proposed system of a single actuating LiDAR sensor.…”
Get full text
Get full text
Get full text
Article -
6
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 -
7
Quantum Processing Framework And Hybrid Algorithms For Routing Problems
Published 2010“…The designed hybrid architecture and framework were tested using the above quantum algorithms and the existing quantum algorithms. …”
Get full text
Get full text
Thesis -
8
Bayesian random forests for high-dimensional classification and regression with complete and incomplete microarray data
Published 2018“…Random Forests (RF) are ensemble of trees methods widely used for data prediction, interpretation and variable selection purposes. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
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
Energy balancing mechanisms for decentralized routing protocols in wireless sensor networks
Published 2012“…Finally, we propose Self-Decision Route Selection scheme which is an improvement of the Hop-based Spanning Tree (HST) algorithm that is used in some routing protocols such as AODV and DSR. …”
Get full text
Get full text
Thesis
