Search Results - (( solution using ((new algorithm) OR (path algorithm)) ) OR ( java implication based algorithm ))
Search alternatives:
- implication based »
- java implication »
- solution using »
- path algorithm »
- new algorithm »
-
1
Finding minimum path by using Genetic Algorithm (GA)/ Siti Zuraifah Hashim
Published 2007“…In this paper, GA has been applied to find the minimum path, then result will be compared with Dijkstra's algorithm are presented.…”
Get full text
Get full text
Thesis -
2
Improved Dynamic Ant Colony System (DACS) on Symmetric Traveling Salesman Problem (TSP).
Published 2007“…Traveling Salesman Problem (TSP) was used as a case study to show the capability of the algorithm in order to find the best solution in terms of the shortest distance. …”
Get full text
Get full text
Conference or Workshop Item -
3
The implications for ahybrid detection technique against malicious sqlattacks on web applications
Published 2025“…The outcome of this study will add to the body of knowledge the most important and recent proposed solutions to mitigate SQL injection attack, in particular those based on machine learning algorithm…”
Get full text
Get full text
Get full text
Article -
4
An Integrated RRT*SMART-A* Algorithm for solving the Global Path Planning Problem in a Static Environment
Published 2023“…The use of sampling-based algorithms such as Rapidly-Exploring Random Tree Star (RRT*) has been widely applied in robot path planning. …”
Get full text
Get full text
Get full text
Article -
5
AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT
Published 2023“…The use o = sampling-based algorithms such as Rapidly-Exploring Random Tree Star (RRT*) has been widely applied in robot path planning. …”
Get full text
Get full text
Get full text
Article -
6
AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT
Published 2023“…The use o = sampling-based algorithms such as Rapidly-Exploring Random Tree Star (RRT*) has been widely applied in robot path planning. …”
Get full text
Get full text
Get full text
Article -
7
AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT
Published 2023“…The use o = sampling-based algorithms such as Rapidly-Exploring Random Tree Star (RRT*) has been widely applied in robot path planning. …”
Get full text
Get full text
Get full text
Article -
8
An adaptive relay selection scheme for enhancing network stability in VANETs
Published 2020“…In this paper, we propose a new improvement to the mechanism of the Optimized Link State Routing Protocol(OLSR) protocol, named Cluster-based Adept Cooperative Algorithm (CACA), where each vehicle estimate a reliable low-overhead path using the cluster-based QoS algorithm. …”
Get full text
Get full text
Get full text
Article -
9
Adaptive rapidly-exploring-random-tree-star (Rrt*) -Smart: algorithm characteristics and behavior analysis in complex environments
Published 2013“…The recent development of its variant: RRT* is considered as a major breakthrough as it makes it possible to achieve optimality in paths planning. However, its limitations include the infinite time it takes to reach the optimal solution and a very slow rate of convergence. …”
Get full text
Get full text
Get full text
Article -
10
AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT
Published 2023“…The use o = sampling-based algorithms such as Rapidly-Exploring Random Tree Star (RRT*) has been widely applied in robot path planning. …”
Get full text
Get full text
Get full text
Article -
11
AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT
Published 2023“…The use o = sampling-based algorithms such as Rapidly-Exploring Random Tree Star (RRT*) has been widely applied in robot path planning. …”
Get full text
Get full text
Get full text
Article -
12
AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT
Published 2023“…The use o = sampling-based algorithms such as Rapidly-Exploring Random Tree Star (RRT*) has been widely applied in robot path planning. …”
Get full text
Get full text
Get full text
Article -
13
An experimental study of neighbourhood based metaheuristic algorithms for test case generation satisfying the modified condition / decision coverage criterion
Published 2018“…Although useful, the existing algorithms does not provide any comparative data to select an algorithm based on the problem size and difficulty and the use of other neighborhood algorithms (including Great Deluge and Late Acceptance Hill Climbing) has not been sufficiently explored as well. …”
Get full text
Get full text
Thesis -
14
Single-solution simulated Kalman Filter algorithm for routing in printed circuit board drilling process
Published 2018“…Principally, ssSKF algorithm uses the standard Kalman filter framework, aided by a local neighborhood technique during its prediction step. …”
Get full text
Get full text
Get full text
Get full text
Book Chapter -
15
Hybrid genetic algorithm with multi-parents recombination for job shop scheduling problems / Ong Chung Sin
Published 2013“…This mechanism is restricted to search the possible solutions in a critical path. Modification on the path by using neighborhood search significantly reduces the total length of the makespan. …”
Get full text
Get full text
Get full text
Thesis -
16
The Evolutionary Convergent Algorithm: A Guiding Path of Neural Network Advancement
Published 2025“…In this study, a new idea centered on seed growth, Seed Growth Algorithm (SGA), as a conditional convergent evolutionary algorithm is proposed for optimizing several discrete and continuous optimization problems. …”
Article -
17
Token based path allocation approach for mobile robots in sorting centre for achieving high throughput
Published 2024“…This project proposes an improved path-finding algorithm that implements token-based path finding while a robot wants to access a grid cell. …”
Get full text
Get full text
Final Year Project / Dissertation / Thesis -
18
An efficient virtual tour : a merging of path planning and optimization
Published 2004“…This paper presents to the development of efficient virtual tour that later will contribute to an efficient design of the building or environment and also optimal solution of the path finding. We expect the result of this research project to be used as a new navigation assistance for visitors to plan their tours in a large exhibition area.…”
Get full text
Get full text
Article -
19
Power line corridor vegetation encroachment detection from satellite images using retinanet and support vector machine
Published 2023“…In this dissertation, a new vegetation encroachment detection method was proposed by studying the feasibility of using the visible-light band of highresolution satellite images using the RetinaNet deep learning model and Support Vector Machine algorithm (SVM). …”
text::Thesis -
20
AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT
Published 2023“…The use o = sampling-based algorithms such as Rapidly-Exploring Random Tree Star (RRT*) has been widely applied in robot path planning. …”
Get full text
Get full text
Get full text
Article
