Search Results - (( _ (constructive OR constructing) path algorithm ) OR ( using solution using algorithm ))
Search alternatives:
- using algorithm »
- path algorithm »
- using solution »
- solution using »
-
1
-
2
-
3
Modeling dynamic weight for 3D navigation routing
Published 2007“…In this paper, an approach for finding shortest path or route in a dynamic situation for indoors and outdoors using Single Sink Shortest Path (SSSP) routing algorithm is proposed. …”
Get full text
Get full text
Conference or Workshop Item -
4
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 -
5
Embedding Malaysian House Red Ant Behavior into an Ant Colony System
Published 2008“…Problem statement: Ant Colony System (ACS) is the most popular algorithm used to find a shortest path solution in Traveling Salesman Problem (TSP). …”
Get full text
Get full text
Citation Index Journal -
6
A comparative performance analysis of computational intelligence techniques to solve the asymmetric travelling salesman problem
Published 2021“…The comparative algorithms in this study employ different techniques in their search for solutions to ATSP: the African Buffalo Optimization employs the modified Karp–Steele mechanism, Model-Induced Max-Min Ant Colony Optimization (MIMM-ACO) employs the path construction with patching technique, Cooperative Genetic Ant System uses natural selection and ordering; Randomized Insertion Algorithm uses the random insertion approach, and the Improved Extremal Optimization uses the grid search strategy. …”
Get full text
Get full text
Get full text
Article -
7
Sampling-based online motion planning for mobile robots: utilization of Tabu search and adaptive neuro-fuzzy inference system
Published 2019“…In this paper, a novel sampling-based algorithm is proposed which is able to plan in an unknown environment and provides solutions with lower cost in terms of path length, runtime and stability of the results. …”
Get full text
Get full text
Article -
8
-
9
Development of a motion planning and obstacle avoidance algorithm using adaptive neuro fuzzy inference system for mobile robot navigation
Published 2017“…Finally, the last objective is to improve the optimality of the new approach using a robust Machine Learning strategy. An adaptive neuro-fuzzy inference system (ANFIS) was designed which constructs and optimizes a fuzzy logic controller using a given dataset of input/output variables in order for the mobile robot to learn. …”
Get full text
Get full text
Get full text
Thesis -
10
Wi-fi fingerprint database construction using Chebyshev wavelet functions
Published 2015“…Proposed algorithm combines the reference data collection procedure with path-loss prediction. …”
Get full text
Get full text
Conference or Workshop Item -
11
Problem Solving
Published 2010“…Although well-structured problems may have a clear path to solution, the route to solution may still be difficult to follow. …”
Get full text
Get full text
Article -
12
Design and analysis of construction and recombination module using Idury Waterman Algorithm for fragment assembly application / Hafifi Mohd Rafi
Published 2012“…There is several algorithms use in sequencing of DNA fragment. This paper presents a study on design and analysis of construction and recombination module using IduryWaterman algorithm and fragment assembly application using Verilog. …”
Get full text
Get full text
Thesis -
13
A hybrid sampling-based path planning algorithm for mobile robot navigation in unknown environments
Published 2013“…Sampling-based motion planning is a class of randomized path planning algorithms with proven completeness. …”
Get full text
Get full text
Thesis -
14
A generalized laser simulator algorithm for optimal path planning in constraints environment
Published 2022“…The suggested algorithm outperforms the competition in terms of improving path cost, smoothness, and search time. …”
Get full text
Thesis -
15
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 -
16
GIS mapping and shortest-path algorithm for drone-aided flood rescue operations
Published 2019“…This research aims to implement Geographic Information System (GIS) mapping to identify the major parts of an affected state that are more susceptible to floods and the construction of an optimal shortest path algorithm to conduct the rescue operation.…”
Get full text
Get full text
Get full text
Proceeding Paper -
17
A Scalable Algorithm for Constructing Frequent Pattern Tree
Published 2014“…In typical FP-Tree construction, besides the prior knowledge on support threshold, it also requires two database scans; first to build and sort the frequent patterns and second to build its prefix paths. …”
Get full text
Get full text
Get full text
Article -
18
An efficient algorithm to improve oil-gas pipelines path
Published 2018“…Therefore, the aim of this study is to propose a new algorithm to obtain the shortest path connecting oil-gas wells and addressing obstacles that may appear on the path connecting any two wells. …”
Get full text
Article -
19
Autonomous path planning robot using geographical information
Published 2008Get full text
Learning Object -
20
Performance comparison between genetic algorithm and ant colony optimization algorithm for mobile robot path planning in global static environment / Nohaidda Sariff
Published 2011“…In the initial stage, the test environments were constructed. Subsequently, both algorithms were applied to the test environments. …”
Get full text
Get full text
Thesis
