Search Results - (( developing leaf optimization algorithm ) OR ( java implementation path algorithm ))
Search alternatives:
- java implementation »
- implementation path »
- leaf optimization »
- developing leaf »
- 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
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
Plant identification using combination of fuzzy c-means spatial pyramid matching, gist, multi-texton histogram and multiview dictionary learning
Published 2016“…Moreover, instead of concatenating feature vectors together and send to classifier, sparse coding and dictionary learning methods are used and instead of considering all features as one view (visual feature), K-SVD algorithm that is one of the famous algorithms for sparse representation is optimized and developed to multi-view model.The experimental results prove that the proposed methods has improved accuracy by 53.77% compared to concatenating features and classic K-SVD dictionary learning model as well.…”
Get full text
Get full text
Thesis -
6
Deep plant: A deep learning approach for plant classification / Lee Sue Han
Published 2018“…They look for the procedures or algorithms that maximize the use of leaf databases for plant predictive modelling, but this results in leaf features which are liable to change with different leaf data and feature extraction techniques. …”
Get full text
Get full text
Get full text
Thesis -
7
Image pre-processing algorithm for Ficus deltoidea Jack (Moraceae) varietal recognition: a repeated perpendicular line scanning approach
Published 2018“…However, the algorithm was developed using semi-automatic algorithm which is strongly believed to give an inaccurate feature measurement. …”
Get full text
Get full text
Get full text
Article -
8
Effective k-Means Clustering in Greedy Prepruned Tree-based Classification for Obstructive Sleep Apnea
Published 2022“…Incorporation of prepruned decision trees to kmeans clustering through one to three types of tree-depth controllers and cluster partitioning was done to develop a combined algorithm named as Greedy Pre-pruned Treebased Clustering (GPrTC) algorithm. …”
Get full text
Get full text
Get full text
Article -
9
Predicting the optimum compositions of a transdermal nanoemulsion system containing an extract of Clinacanthus nutans leaves (L.) for skin antiaging by artificial neural network mo...
Published 2017“…A nanoemulsion-based formulation containing leaf extracts of Clinacanthus nutans Lindau (C. nutans) was prepared for therapeutic use and optimized by artificial neural network (ANN). …”
Get full text
Get full text
Get full text
Article -
10
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
