Search Results - (( java implication force algorithm ) OR ( _ construct ((search algorithm) OR (path algorithm)) ))
Search alternatives:
- implication force »
- java implication »
- force algorithm »
- path algorithm »
- _ construct »
- search »
-
1
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 -
2
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 -
3
Test case generation from state machine with OCL constraints using search-based techniques / Aneesa Ali Ali Saeed
Published 2017“…The whole constraint analyzer and the fitness function were combined with four SBTs (genetic algorithm, evolutionary algorithm, simulating annealing, and quantum genetic algorithm). …”
Get full text
Get full text
Get full text
Thesis -
4
Frequent itemset mining using graph theory / Mohammad Arsyad Mohd Yakop
Published 2017“…Designing the FRG-Closed involves new data structure creation known as Frequent Row Graph or FR-Graph. The searching process in the FR-Graph involves the construction of two methods: getPath and item-merging. …”
Get full text
Get full text
Thesis -
5
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 -
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
-
8
Design and analysis multiple paths trace back and reconstruction module for DNA sequence alignment accelerator using ASIC design flow: article / Nurul Ain Husaini
Published 2010“…The first objective is to construct the trace back and reconstruction module of the S-W algorithm with the multiple blocks and the functionality for each block. …”
Get full text
Get full text
Article -
9
Design and analysis multiple paths trace back and reconstruction module for DNA sequence alignment accelerator using ASIC design flow / Nurul Ain Husaini
Published 2010“…The first objective is to construct the trace back and reconstruction module of the S-W algorithm with the multiple blocks and the functionality for each block. …”
Get full text
Get full text
Student Project -
10
Improving the efficiency of minimum determinant computation in space time trellis code with optimal subtree pruning
Published 2024“…In the heuristic optimization of code construction, the minimum determinant is derived via a variant of the branch and bound algorithm. …”
Get full text
Get full text
Get full text
Article -
11
A Hybrid Metaheuristic Technique Based on Grey Wolf Optimisation, Symbiotic Organism Search, and Ant Colony Optimisation for Solving Multi-Objective Vehicle Routing Problems
Published 2025“…The hybridisation mechanism combines the global exploration strength of GWO, the solution refinement capability of SOS, and the effective path construction of ACO into an integrated search strategy. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
12
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 -
13
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 -
14
-
15
Utilizing the roulette wheel based social network search algorithm for substitution box construction and optimization
Published 2023“…This paper introduces a new variant of a recent metaheuristic algorithm based on the Social Network Search algorithm (SNS), which is called the Roulette Wheel Social Network Search algorithm (SNS). …”
Get full text
Get full text
Get full text
Get full text
Article -
16
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 -
17
Autonomous path planning robot using geographical information
Published 2008Get full text
Learning Object -
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
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 -
20
Shortest path from Bandar Tun Razak to Berjaya Times Square using Dijkstra Algorithm / Nur Syuhada Muhammat Pazil ... [et al.]
Published 2020“…Moreover, Dijkstra algorithm is applied to find the shortest path. The shortest path is calculated by using C programming of Dev C++. …”
Get full text
Get full text
Get full text
Article
