Search Results - (( java implementation path algorithm ) OR ( using cluster binding algorithm ))

Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer by Ahmad Nezer, Nurul Aqilah

“…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

Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization by Mohammad Ata, Karimeh Ibrahim

“…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

Path planning for unmanned aerial vehicle (UAV) using rotated accelerated method in static outdoor environment by Shaliza Hayati A. Wahab, Nordin Saad, Azali Saudi, Ali Chekima

“…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

Smart appointment organizer for mobile application / Mohd Syafiq Adam by Adam, Mohd Syafiq

“…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

Image clustering comparison of two color segmentation techniques by Subramaniam, Kavitha Pichaiyan

“…There are many algorithm for analysing clustering each having its own method to do clustering. …”
Get full text
Get full text
Get full text
Get full text

SOMEA: self-organizing map based extraction algorithm for DNA motif identification with heterogeneous model by Lee, Nung Kion, Wang, Dianhui

“…Results: This paper aims to develop a Self-Organizing Map (SOM) based clustering algorithm for extracting binding sites in DNA sequences. …”
Get full text
Get full text
Get full text

Computational study of cobalt oxide: Nanoparticles, surfaces and thin films supported on metal oxide surfaces / Ala’ Omar Hasan Zayed by Ala’ Omar , Hasan Zayed

“…Besides using our genetic algorithm code called Universal Genetic Algorithm (UGA) combined with DFT calculations to find the global and local energy minimum structures of (CoO)n (n = 3 − 7) clusters, we have also extended the search space to (CoO)nq (n = 3−10, q = 0, +1) clusters by another code of ours, the Modified Basin-Hopping Monte Carlo Algorithm (MBHMC) program, accompanied by accurate DFT calculations. …”
Get full text
Get full text
Get full text

Filtering of Background DNA Sequences Improves DNA Motif Prediction Using Clustering Techniques by Lee, Nung Kion, Chieng, Allen Hoon Choong

“…Noisy objects have been known to affect negatively on the performance of clustering algorithms. This paper addresses the problem of high false positive rates in using self-organizing map (SOM) for DNA motif prediction due to the noisy background sequences in the input dataset. …”
Get full text
Get full text
Get full text

Evolutionary cost-cognizant regression test case prioritization for object-oriented programs by Bello, AbdulKarim

“…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

SOMIX: Motifs Discovery in Gene Regulatory Sequences Using Self-Organizing Maps by Lee, Nung Kion, Wang, Dianhui

Get full text
Get full text
Get full text

Adaptive persistence layer for synchronous replication (PLSR) in heterogeneous system by Beg, Abul Hashem

“…The PLSR architecture model, workflow and algorithms are described. The PLSR has been developed using Java Programming language. …”
Get full text
Get full text