Search Results - (( web application bees algorithm ) OR ( its ((application graph) OR (application a)) algorithm ))*
Search alternatives:
- application graph »
- application bees »
- web application »
- bees algorithm »
- application a »
-
1
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 -
2
Ant colony optimization based subset feature selection in speech processing: Constructing graphs with degree sequences
Published 2024journal::journal article -
3
-
4
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 -
5
Identification of power poles based on satellite stereo images using graph-cut algorithm
Published 2015Get full text
Get full text
Conference or Workshop Item -
6
Max degree around (MDA) algorithm: a smart and efficient approximate algorithm for Vertex cover and independent set problems
Published 2016“…MVC and MIS are notable for its capability of modelling other combinatorial problems and real-world applications. …”
Get full text
Get full text
Get full text
Article -
7
-
8
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 -
9
Task scheduling in cloud computing environment using hybrid genetic algorithm and artificial bee colony
Published 2022Get full text
Get full text
Get full text
Academic Exercise -
10
-
11
An Improved of Channel Allocation for WLAN Using Vertex Merge Algorithm
Published 2012Get full text
Get full text
Conference or Workshop Item -
12
-
13
-
14
The conceptual framework of knowledge of large scale and incomplete graphs of skyline queries optimization using machine learning
Published 2025“…Ever since its introduction into the database community, skyline queries have been widely adopted in a range of contemporary database applications. …”
Get full text
Get full text
Get full text
Get full text
Proceeding Paper -
15
Unapparent information revelation for counterterrorism: Visualizing associations using a hybrid graph-based approach
Published 2012Get full text
Get full text
Get full text
Conference or Workshop Item -
16
Dynamical fuzzy autocatalytic set of combustion process in circulating fluidized bed boiler using transition matrix / Hazwani Hashim
Published 2014“…Thus it leads to the establishment of an improvised Graph Dynamics Algorithm which is used to assist the analysis of graph dynamics of FACS in CFB. …”
Get full text
Get full text
Thesis -
17
-
18
A multi-objective Spiral Dynamic algorithm and its application for PD design
Published 2017“…In terms of its application in solving a real problem, both algorithms successfully optimize the PD and control the system very well. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
19
A hybrid local search algorithm for minimum dominating set problems
Published 2022“…In MPIDS, the aim is to identify a subset of vertices where each vertex of a graph must be dominated by at least half of its neighbors. …”
Get full text
Get full text
Article -
20
A hybrid local search algorithm for minimum dominating set problems
Published 2022“…In MPIDS, the aim is to identify a subset of vertices where each vertex of a graph must be dominated by at least half of its neighbors. …”
Get full text
Get full text
Article
