Search Results - (( _ application ((graph algorithm) OR (means algorithm)) ) OR ( its application a algorithm ))*
Search alternatives:
- graph algorithm »
- means algorithm »
- application a »
- a algorithm »
-
1
-
2
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 -
3
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 -
4
Ant colony optimization based subset feature selection in speech processing: Constructing graphs with degree sequences
Published 2024journal::journal article -
5
-
6
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 -
7
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 -
8
Identification of power poles based on satellite stereo images using graph-cut algorithm
Published 2015Get full text
Get full text
Conference or Workshop Item -
9
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 -
10
-
11
-
12
An Improved of Channel Allocation for WLAN Using Vertex Merge Algorithm
Published 2012Get full text
Get full text
Conference or Workshop Item -
13
-
14
A comparative analysis of LSTM, SVM, and GSTANN models for enhancing solar power prediction
Published 2024Get full text
Get full text
Get full text
Get full text
Proceeding Paper -
15
Visual Crowd Counting System Using Deep Learning
Published 2021Get full text
Get full text
Final Year Project / Dissertation / Thesis -
16
A Review on Attack Graph Analysis for IoT Vulnerability Assessment: Challenges, Open Issues, and Future Directions
Published 2024“…Attack graphs serve as a valuable cybersecurity tool for modeling and analyzing potential attack scenarios on systems, networks, or applications. …”
Review -
17
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 -
18
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 -
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
Ant colony optimization algorithm for load balancing in grid computing
Published 2012Get full text
Get full text
Get full text
Monograph
