Search Results - (( developing improving path algorithm ) OR ( java implementation using algorithm ))
Search alternatives:
- developing improving »
- implementation using »
- java implementation »
- using algorithm »
- improving path »
- path algorithm »
-
1
RSA Encryption & Decryption using JAVA
Published 2006“…References and theories to support the research of 'RSA Encryption/Decryption using Java' have been disclosed in Literature Review section. …”
Get full text
Get full text
Final Year Project -
2
Evolutionary cost-cognizant regression test case prioritization for object-oriented programs
Published 2019“…The recent trend of software development uses OO paradigm. 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 -
3
Provider independent cryptographic tools
Published 2003“…The library is implemented by using Java cryptographic service provider framework that conforms to Java Cryptographic Architecture (JCA) and Java Cryptographic Extension (JCE). …”
Get full text
Get full text
Get full text
Monograph -
4
Direct approach for mining association rules from structured XML data
Published 2012“…The thesis also provides a two different implementation of the modified FLEX algorithm using a java based parsers and XQuery implementation. …”
Get full text
Get full text
Thesis -
5
The Development Of A Robust Algorithm For Uav Path Planning In 3d Environment
Published 2016“…Thus, a new algorithm known as infection evolution (IE) was developed in this study. …”
Get full text
Get full text
Thesis -
6
Adaptive path finding algorithm in dynamic environment for warehouse robot
Published 2020“…For example, A* path finding algorithm is developed to obtain the shortest path, while D* obtains a complete coverage path from source to destination. …”
Get full text
Get full text
Get full text
Article -
7
Plagiarism Detection System for Java Programming Assignments by Using Greedy String-Tilling Algorithm
Published 2008“…The prototype system, known as Java Plagiarism Detection System (JPDS) implements the Greedy-String-Tiling algorithm to detect similarities among tokens in a Java source code files. …”
Get full text
Get full text
Get full text
Thesis -
8
Development of an improved Jellyfish Search (JS) algorithm for solving the optimal path problem of multi-robot collaborative multi-tasking in complex vertical farms
Published 2025“…This paper proposes an improved Jellyfish Search algorithm, namely TLDW-JS, for solving the problem of optimal path planning of multi-robot collaboration in the multi-tasking of complex vertical farming environments. …”
Get full text
Get full text
Get full text
Article -
9
Nlfxlms and thf-nlfxlms algorithms for wiener-hammerstein nonlinear active noise control
Published 2016“…It is hypothesised that incorporating the acoustic path model would improve the modelling of the secondary path and subsequently improves the level of noise cancellation. …”
Get full text
Get full text
Thesis -
10
Performance evaluation of real-time multiprocessor scheduling algorithms
Published 2016“…We hyave used the CPU profiler of Oracle JavaTM VisualVM to monitor the execution of LRE-TL as well as USG algorithms. …”
Get full text
Get full text
Conference or Workshop Item -
11
Simulation of shortest path using a-star algorithm / Nurul Hani Nortaja
Published 2004“…Definitely this best first search algorithm saves the searching time and improves performance of shortest path finding.…”
Get full text
Get full text
Thesis -
12
Automatic Number Plate Recognition on android platform: With some Java code excerpts
Published 2016“…On the other hand, the traditional algorithm using template matching only obtained 83.65% recognition rate with 0.97 second processing time. …”
Get full text
Get full text
Get full text
Book -
13
Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator: article
Published 2010“…This paper presents the improvement of Smith-Waterman algorithm in comparing between two DNA sequence alignments. …”
Get full text
Get full text
Article -
14
Path planning for unmanned aerial vehicles using visibility line-based methods
Published 2011“…In order to ensure that the 3D path planning algorithms are computationally efficient, the proposed 2D path planning algorithms are applied into them. …”
Get full text
Get full text
Thesis -
15
Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator
Published 2010“…This paper presents the improvement of Smith-Waterman algorithm in comparing between two DNA sequence alignments. …”
Get full text
Get full text
Student Project -
16
Audio Streaming System Using Real-Time Transport Protocol Based on Java Media Framework
Published 2004“…Java Media Framework library and the RTP protocol for audio transmission were used as development tools.The developed system designed in this thesis together with experimental results proved that the system could be implemented successfully. …”
Get full text
Get full text
Thesis -
17
Optimization of mobile robot path planning in semi-dynamic environment using genetic algorithm
Published 2023“…Thus, this thesis aims to develop a mobile robot for industrial applications by leveraging a genetic algorithm (GA). …”
Get full text
Get full text
Get full text
Get full text
Thesis -
18
-
19
Traffic management algorithms for LEO satellite networks
Published 2016“…In this thesis, several proposed algorithms have been developed to improve the traffic performance in the LEO satellite network. …”
Get full text
Get full text
Get full text
Thesis -
20
Computationally-efficient path planning algorithms in obstacle-rich environments based on visibility graph method
Published 2018“…Cun·ent studies have been focused on developing path planning algorithms to satisfy the criteria of path planning namely minimum path length, low computation time and complete, i.e., it gives positive result if a path is available or negative if otherwise. …”
Get full text
Get full text
Get full text
Get full text
Thesis
