Search Results - (( program visualization clustering algorithm ) OR ( java implementation path algorithm ))
Search alternatives:
- visualization clustering »
- java implementation »
- implementation path »
- path algorithm »
-
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
-
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
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 -
6
Mathematical simulation for 3-dimensional temperature visualization on open source-based grid computing platform
Published 2009“…The development of this architecture is based on several programming language as it involves algorithm implementation on C, parallelization using Parallel Virtual Machine (PVM) and Java for web services development. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
7
Enhanced bibliographic data retrieval and visualization using query optimization and spectral centrality measure
Published 2019“…This study proposing an enhance bibliographic data retrieval and visualization using hybrid clustering method consists of K-harmonic mean (KHM) and Spectral Algorithm and eigenvector centrality measure. …”
Get full text
Get full text
Get full text
Article -
8
STATISTICAL FEATURE LEARNING THROUGH ENHANCED DELAUNAY CLUSTERING AND ENSEMBLE CLASSIFIERS FOR SKIN LESION SEGMENTATION AND CLASSIFICATION
Published 2021“…Moreover, skin lesion images are clustered based on fused color, pattern and shape based features. …”
Get full text
Get full text
Get full text
Article -
9
A coverage path planning approach for autonomous radiation mapping with a mobile robot
Published 2023Article -
10
Facilitating resource allocation decision through Bibliomining: the case of UTM's library / Md Razib Karno
Published 2015“…The data mining technique was adopted to explore the relationship among statistically patterned and clustered bibliographic data. Bibliomining are tools that can visualize how libraries manage their costs, staff activity, customer service, user needs, marketing, popular books, circulation, reference transaction, quality of collection, educational programs etc. …”
Get full text
Get full text
Thesis -
11
Classification of Distracted Male Driver Based on Driving Performance Indicator (DPI)
Published 2024“…Weka is a strong data mining and machine learning program including algorithms for data preparation, classification, regression, clustering, and visualization. …”
Get full text
Get full text
Get full text
Get full text
Conference or Workshop Item -
12
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 -
13
Bottleneck-based heuristic for permutation flowshop scheduling
Published 2017“…There are four potential dominant machines (M1, M2, M3, M4) clustered as bottleneck machines. A total 1000 set random processing time for each job sizes was tested using Excel simple programming with built in Visual Basic for Application (VBA). …”
Get full text
Get full text
Get full text
Get full text
Thesis
