Search Results - (( java implementation path algorithm ) OR ( basic relation tree algorithm ))
Search alternatives:
- java implementation »
- implementation path »
- path algorithm »
- tree algorithm »
- relation tree »
-
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
Application Of Multi-Layer Perceptron Technique To Detect And Locate The Base Of A Young Corn Plant
Published 2007“…Prior to localization of the base of young corn tree, skeletonizing operation is performed to get the basic shape of the object. …”
Get full text
Get full text
Thesis -
6
Petri Net Algorithm for controlling and monitoring system
Published 2009Get full text
Working Paper -
7
Robotic path planning using rapidly-exploring random trees
Published 2013“…This study concerns the implementation of Rapidly-Exploring Random Trees (RRTs) algorithm for an autonomous robot path planning. …”
Get full text
Get full text
Get full text
Thesis -
8
Recovery of tree community composition across different types of anthropogenic disturbances and characterization of their effect using Landsat time series in Bornean tropical monta...
Published 2022“…Five LTS metrics—time since the greatest disturbance (TSD), magnitude of disturbance (MD), distance to undisturbed forests (d_UND), recovery indicator (RI), and years to recovery (Y2R) were derived and were related to field-based tree community composition. …”
Get full text
Get full text
Get full text
Get full text
Get full text
Article -
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 an Activity Recognition System Using Accelerometers
Published 2014“…With accelerometers that capture the acceleration rate of different activities and Decision Tree algorithm for classification, the system is able to predict accurately the activity performed by the wearer. …”
Get full text
Get full text
Final Year Project -
11
Automatic extraction of digital terrain model and Building Footprint from airborne LiDAR data using rule-based learning techniques
Published 2021“…Therefore, in this research an algorithm has been created which can achieve the following goals. 1) To generate DTM only with LiDAR data without the need for layers and other information from the area 2) To create a building footprint from the LiDAR data by removing the tree cover effect 3) To create an automatic system that can perform the production process of DTM and footprint without the intervention of an expert. …”
Get full text
Get full text
Get full text
Thesis -
12
Twofold Integer Programming Model for Improving Rough Set Classification Accuracy in Data Mining.
Published 2005“…The accuracy for rules and classification resulted from the TIP method are compared with other methods such as Standard Integer Programming (SIP) and Decision Related Integer Programming (DRIP) from Rough Set, Genetic Algorithm (GA), Johnson reducer, HoltelR method, Multiple Regression (MR), Neural Network (NN), Induction of Decision Tree Algorithm (ID3) and Base Learning Algorithm (C4.5); all other classifiers that are mostly used in the classification tasks. …”
Get full text
Get full text
Thesis
