Search Results - (( develop string means algorithm ) OR ( java implementation path algorithm ))
Search alternatives:
- java implementation »
- implementation path »
- means algorithm »
- develop string »
- 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
Dynamic key scheduling algorithm for block ciphers using quasigroup string transformation
Published 2018“…Based on the dynamic shapeless quasigroup and the proposed new string transformation, a Dynamic Key Scheduling Algorithm (DKSA) is developed. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
6
VLSI floor planning optimization using genetic algorithm and cross entropy method / Angeline Teoh Szu Fern
Published 2012“…They are Cross Entropy and also Genetic Algorithm. CE is a new algorithm that was recently developed using probability. …”
Get full text
Get full text
Thesis -
7
Enhancing obfuscation technique for protecting source code against software reverse engineering
Published 2019“…The proposed technique contains three approaches; first approach is string encryption. The string encryption is about adding a mathematical equation with arrays and loops to the strings in the code to hide the meaning. …”
Get full text
Get full text
Thesis -
8
Design and modelling of an autonomous robotic airship with soft computing control
Published 2012“…The control system were tested on simulation which were developed from simulink. The result shows a feasible means of UAV control. …”
Get full text
Get full text
Get full text
Thesis -
9
A study on component-based technology for development of complex bioinformatics software
Published 2004“…The second layer uses discriminative SVM algorithm with a state-of-the-art string kernel based on PSI-BLAST profiles that is used to leverage the unlabeled data. …”
Get full text
Get full text
Monograph -
10
Development of compound clustering techniques using hybrid soft-computing algorithms
Published 2006“…The hierarchical fuzzy clustering method developed here is far better than a similar implementation of the hard k-means method. …”
Get full text
Get full text
Monograph -
11
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 -
12
Pseudo-random number generator (PRNG) combined with text based watermarking for cryptography application / Lew Chee Hon
Published 2017“…The sentence selected for embedding watermarking bit are 85% higher in speed due to faster embedding watermarking bit string.The relation of information-hiding capacity is 1:5.5 which means that for every 5.5 terms of text, one bit of watermark can be hidden data. …”
Get full text
Get full text
Get full text
Thesis -
13
