Search Results - (( _ application a algorithm ) OR ( its application ((graph algorithm) OR (bat algorithm)) ))*
Search alternatives:
- graph algorithm »
- application a »
- bat algorithm »
- a algorithm »
-
1
Bats echolocation-inspired algorithms for global optimisation problems
Published 2016“…The algorithm is a hybrid algorithm that operates using dual level search strategy that takes merits of a particle swarm optimisation algorithm and a modified adaptive bats sonar algorithm. …”
Get full text
Get full text
Thesis -
2
A Preliminary Study on Camera Auto Calibration Problem Using Bat Algorithm
Published 2013“…Each bat in Bat Algorithm represents a candidate solution for the problem and each dimension in the search space of the Bat Algorithm represents a parameter of intrinsic parameters: skew, focal length, and magnification factor. …”
Get full text
Get full text
Conference or Workshop Item -
3
Performance evaluation of PID controller optimisation for wheel mobile robot using Bat based optimisation algorithm
Published 2022“…In this study, a new proposed hybrid optimization algorithm, called Extended Bat Algorithm (EBA) is used for optimizing the PID controller for the wheel mobile robot. …”
Get full text
Get full text
Book Chapter -
4
An improved genetic bat algorithm for unconstrained global optimization problems
Published 2020Get full text
Get full text
Get full text
Conference or Workshop Item -
5
Modified adaptive bats sonar algorithm with doppler effect mechanism for solving single objective unconstrained optimization problems
Published 2019Get full text
Get full text
Conference or Workshop Item -
6
-
7
-
8
PID controller design for mobile robot using Bat Algorithm with Mutation (BAM)
Published 2019“…This algorithm is compared with a wellknown optimization algorithm, Particle Swarm Optimization (PSO). …”
Get full text
Get full text
Get full text
Get full text
Conference or Workshop Item -
9
IMPLEMENTATION OF GRAPH BASED PATH PLANNING ALGORITHMS FOR INDOOR NAVIGATION
Published 2018“…Thus, the A* algorithm is implemented in a small mobile robot, this is to see its effectiveness in real world application. …”
Get full text
Get full text
Final Year Project -
10
Ant colony optimization based subset feature selection in speech processing: Constructing graphs with degree sequences
Published 2024journal::journal article -
11
New random approaches of modified adaptive bats sonar algorithm for reservoir operation optimization problems
Published 2024“…The Modified Adaptive Bats Sonar Algorithm (MABSA), initially designed for single objective optimization and inspired by colony bats' echolocation, has demonstrated efficiency with its simple structure and reduced computation time. …”
Get full text
Get full text
Thesis -
12
-
13
Enhancing benchmark optimization with evolutionary random approach: A comparative analysis of modified adaptive bats sonar algorithm (MABSA)
Published 2025“…This article presents a novel hybrid algorithm, combining the Modified Adaptive Bats Sonar Algorithm (MABSA) with the Squirrel Search Algorithm (SSA), and compares its performance with the original MABSA. …”
Get full text
Get full text
Get full text
Get full text
Conference or Workshop Item -
14
Graph-Based Algorithm With Self-Weighted And Adaptive Neighbours Learning For Multi-View Clustering
Published 2024“…To address this issue, this study incorporated joint graph learning from the gmc algorithm into swmcan, creating a new algorithm called swmcan-jg. …”
Get full text
Get full text
Thesis -
15
Max degree around (MDA) algorithm: a smart and efficient approximate algorithm for Vertex cover and independent set problems
Published 2016“…The aim of this paper is twofold: first to investigate failures of the state-of- the-art algorithms for MVC problem on small graphs and second to propose a simple and efficient approximation algorithm for the minimum vertex cover problem. …”
Get full text
Get full text
Get full text
Article -
16
-
17
Identification of power poles based on satellite stereo images using graph-cut algorithm
Published 2015Get full text
Get full text
Conference or Workshop Item -
18
-
19
An Improved-Time Polynomial-Space Exact Algorithm For TSP In Degree-5 Graphs
Published 2017“…The Traveling Salesman Problem (TSP) is one of the most well-known NP-hard optimization problems. Following a recent trend of research which focuses on developing algorithms for special types of TSP instances, namely graphs of limited degree, in an attempt to reduce a part of the time and space complexity, we present a polynomial-space branching algorithm for the TSP in an n-vertex graph with degree at most 5, and show that it has a running time of O∗(2.3500n), which improves the previous best known time bound of O∗(2.4723n) given by the authors (the 12th International Symposium on Operations Research and Its Application (ISORA 2015), pp.45–58, 2015). …”
Get full text
Get full text
Get full text
Get full text
Article -
20
