Search Results - (( using selection path algorithm ) OR ( program implementation using algorithm ))
Search alternatives:
- program implementation »
- implementation using »
- using selection »
- using algorithm »
- selection path »
- path algorithm »
-
1
Optimization Of Two-Dimensional Dual Beam Scanning System Using Genetic Algorithms
Published 2008“…Also, this research involves in developing a machine-learning system and program via genetic algorithm that is capable of performing independent learning capability and optimization for scanning sequence using novel GA operators. …”
Get full text
Get full text
Thesis -
2
Design, development and performance optimization of a new artificial intelligent controlled multiple-beam optical scanning module
Published 2006“…This research presents a new approach to optimise the performance of a multiple-beam optical scanning system in terms of its marking combinations and speed, using Genetic Algorithm (GA). The problem has been decomposed into two sub problems; task segregation, where the marking tasks need to be segregated and assigned for each scanner head and path planning where the best combinatorial paths for each scanner are determined in order to minimise the total motion of marking time. …”
Get full text
Get full text
Get full text
Article -
3
Design, development and performance optimization of a new artificial intelligent controlled multiple-beam optical scanning module
Published 2023“…This research presents a new approach to optimise the performance of a multiple-beam optical scanning system in terms of its marking combinations and speed, using Genetic Algorithm (GA). The problem has been decomposed into two sub problems; task segregation, where the marking tasks need to be segregated and assigned for each scanner head and path planning where the best combinatorial paths for each scanner are determined in order to minimise the total motion of marking time. …”
Article -
4
Design, development and performance optimization of a new artificial intelligent controlled multiple-beam optical scanning module
Published 2023“…This research presents a new approach to optimise the performance of a multiple-beam optical scanning system in terms of its marking combinations and speed, using Genetic Algorithm (GA). The problem has been decomposed into two sub problems; task segregation, where the marking tasks need to be segregated and assigned for each scanner head and path planning where the best combinatorial paths for each scanner are determined in order to minimise the total motion of marking time. …”
Article -
5
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 -
6
Automated path testing using the negative selection algorithm
Published 2017“…Negative selection algorithm (NSA) has been used in this paper to generate test data for path testing automatically. …”
Get full text
Get full text
Indexed Article -
7
Optimisation of Environmental Risk Assessment Architecture using Artificial Intelligence Techniques
Published 2024“…By contrast, the results of the safe path selection model were compared with the results obtained using Dijkstra's algorithm and the Floyd-Warshall algorithm. …”
thesis::doctoral thesis -
8
Path planning for unmanned aerial vehicles using visibility line-based methods
Published 2011“…The proposed 2D path planning algorithms, on the contrary, select a relatively smaller number of vertices using the so-called base line (BL), thus they are computationally efficient. …”
Get full text
Get full text
Thesis -
9
Optimal QoS aware multiple paths web service composition using heuristic algorithms and data mining techniques
Published 2014“…Second, both the constructive procedure (CP) and the complementary procedure (CCP) heuristic algorithms computed the optimization considering only the execution path that has been predicted by the runtime path prediction method for criteria selection, eight QoS characteristics are suggested after investigating related works on the area of web service and web service composition. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
10
A novel Bezier curve control point search algorithm for autonomous navigation using N-order polynomial search with boundary conditions
Published 2021“…However, the Bezier curve is the most widely used in the curve fitting algorithm for vehicle path planning as it can generate a possible number of path maneuvers. …”
Get full text
Get full text
Get full text
Get full text
Conference or Workshop Item -
11
Route optimization using shortest path method / Muhamad Faisal Amin Shakri
Published 2025“…This study investigated the implementation and comparison between well known shortest path method which are Dijkstra’s algorithm, Bellman-Ford, and A* algorithm. …”
Get full text
Get full text
Thesis -
12
A Continuous Overlay Path Probing Algorithm For Overlay Networks
Published 2013“…Such an in-band probing algorithm reduces measurement overhead on the selected overlay path. …”
Get full text
Get full text
Thesis -
13
Path planning for visually impaired people in an unfamiliar environment using particle swarm optimization
Published 2015“…Here, in this paper, we propose a path planning with predetermined waypoints method using Particle Swarm Optimization (PSO) algorithm. …”
Get full text
Get full text
Get full text
Article -
14
A hybrid sampling-based path planning algorithm for mobile robot navigation in unknown environments
Published 2013“…These algorithms generate paths using random numbers and perform efficiently in guiding the robot in known environments. …”
Get full text
Get full text
Thesis -
15
Shortest Path Routing Using Heuristic Search
Published 2006“…In this project A* algorithm was used, to suggest shortest path model between two selected points to find the fastest and shortest route on Malaysia map. …”
Get full text
Get full text
Get full text
Thesis -
16
Integration of enchanced jump point search (JPS) algorithm with modified bresenham technique for path planning in virtual grid-based environment
Published 2018“…The second approach is the modification of heuristic computation using original A* and modified Bresenham. Bresenham Line Algorithm is a line generation algorithm using integer arithmetic where the points (x1, y1) and (x2, y2) are assumed not equal and integer valued. …”
Get full text
Get full text
Get full text
Thesis -
17
Evaluation of robot path planning algorithms in global static environments: genetic algorithm vs ant colony optimization algorithm / Nohaidda Sariff and Norlida Buniyamin
Published 2010“…Performances between both algorithms were compared and evaluated in terms of speed and number of iterations that each algorithm takes to find an optimal path within several selected environments. …”
Get full text
Get full text
Get full text
Article -
18
Attack path selection optimization with adaptive genetic algorithms
Published 2016“…Attack paths that satisfy certain optimization criteria are then selected and presented as possible components of the security solution. …”
Get full text
Get full text
Article -
19
Attack path selection optimization with adaptive genetic algorithms
Published 2016“…Attack paths that satisfy certain optimization criteria are then selected and presented as possible components of the security solution. …”
Get full text
Get full text
Article -
20
An enhancement of path selection to cluster head based on multi-hop routing in two-tier wireless sensor network
Published 2019“…The element of Shortest Path First (SPF) Algorithm that is used in a routing protocol will be implemented. …”
Get full text
Get full text
Get full text
Get full text
Article