Search Results - ((((((graph algorithm) OR (search algorithm))) OR (_ algorithm))) OR (based algorithm))
Search alternatives:
-
1
VISUALIZATION OF GENETIC ALGORITHM BASED ON 2-D GRAPH TO ACCELERATE THE SEARCHING WITH HUMAN INTERVENTIONS.
Published 2012“…Visualization techniques help in understanding the searching behaviour of Genetic Algorithm. lt also makes possible the user interactions during the searching process. …”
Get full text
Get full text
Thesis -
2
Synthesis of transistor-chaining algorithm for CMOS cell layout using bipartite graph / Azizi Misnan
Published 1997“…A depth - first search algorithm is used to search for optimal chaining. …”
Get full text
Get full text
Thesis -
3
Ant colony optimization based subset feature selection in speech processing: Constructing graphs with degree sequences
Published 2024Subjects:journal::journal article -
4
IMPLEMENTATION OF GRAPH BASED PATH PLANNING ALGORITHMS FOR INDOOR NAVIGATION
Published 2018“…In this study, we are looking at the performance of four graph-based path planning algorithms which is Breadth First Search, Depth First Search, Dijkstra and A*, when implemented in real world applications. …”
Get full text
Get full text
Final Year Project -
5
A hybrid local search algorithm for minimum dominating set problems
Published 2022“…To solve these problems, we propose a two-stage hybrid local search algorithm. In the first stage, we propose an adaptive information content-based local search algorithm as an exploratory procedure. …”
Get full text
Get full text
Article -
6
A hybrid local search algorithm for minimum dominating set problems
Published 2022“…To solve these problems, we propose a two-stage hybrid local search algorithm. In the first stage, we propose an adaptive information content-based local search algorithm as an exploratory procedure. …”
Get full text
Get full text
Article -
7
Solving the minimum dominating set problem of partitioned graphs using a hybrid bat algorithm
Published 2020“…However, population-based algorithms are not good in exploiting the search space in comparison to single-solution based methods, therefore, we included the Simulated annealing (SA) algorithm to balance between exploitation and exploration in order to reach a best possible solution. …”
Get full text
Get full text
Article -
8
Frequent itemset mining using graph theory / Mohammad Arsyad Mohd Yakop
Published 2017“…The Directed Acyclic Graph in High Dimensional Dataset Mining (DAGHDDM) is a graph-based mining algorithm that represents itemsets in complete graph before FIM takes place. …”
Get full text
Get full text
Thesis -
9
African Buffalo Optimization (ABO): A New Metaheuristic Algorithm
Published 2015“…This paper proposes a new meta-heuristic approach to solving numerical and graph-based problems. The African buffalo algorithm evolved from an understanding of the animal's survival instincts and the search techniques they utilize in the African forests and savannahs; the search for the optimal path to pasture is aligned to their cooperative, intelligent, and social nature. …”
Get full text
Get full text
Get full text
Article -
10
Hybrid bat algorithm for minimum dominating set problem
Published 2017“…In this paper, the stochastic search represented by hybrid swarm intelligence algorithm to find the smallest set of nodes that dominate the graph. …”
Get full text
Get full text
Article -
11
A genetic similarity algorithm for searching the Gene Ontology terms and annotating anonymous protein sequences
Published 2008“…Then, the parallel genetic algorithm is employed to perform batch retrieval and to accelerate the search in large search space of the Gene Ontology graph. …”
Get full text
Get full text
Get full text
Article -
12
Enhancing three variants of harmony search algorithm for continuous optimization problems
Published 2021“…Harmony search (HS) is a recognized meta-heuristic algorithm with an efficient exploration process. …”
Get full text
Get full text
Get full text
Article -
13
Guidance system based on Dijkstra-ant colony algorithm with binary search tree for indoor parking system
Published 2021“…However, the traditional Dijkstra’s is not accurate and need more time to perform the path in order it should visit all the nodes in the graph. In this paper, the Dijkstra-ant colony algorithm (ACO) with binary search tree (BST) has been proposed. …”
Get full text
Get full text
Get full text
Article -
14
Aco-based feature selection algorithm for classification
Published 2022“…An enhanced graph clustering ant colony optimisation (EGCACO) algorithm is proposed to solve the three (3) MGCACO algorithm problems. …”
Get full text
Get full text
Thesis -
15
Quantum Processing Framework And Hybrid Algorithms For Routing Problems
Published 2010Subjects: Get full text
Get full text
Thesis -
16
A Modified ACO-based Search Algorithm for Detecting Protein Functional Module From Protein Interaction Network
Published 2015“…The experimental result have proved that ACO-PFMDM have improved the overall performance of protein functional module detection. The search process of ACO-PFMDM has converged effectively compared to some state-of-art algorithms. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
17
A Hybrid ACO-Graph Entropy for Functional Modules Detection From Protein-Protein Interaction Network
Published 2018“…The experimental result have proved that ACO-PFMDM have improved the overall performance of protein functional module detection. The search process of ACO-PFMDM has converged effectively compared to some state-of-art algorithms. …”
Get full text
Get full text
Get full text
Article -
18
-
19
Novel Adaptive Bacterial Foraging Algorithms for Global Optimisation with Application to Modelling of a TRS
Published 2015“…Moreover, based on the statistical result, non-parametric Friedman and Wilcoxon signed rank tests and parametric t-test are performed to check the significant difference in the performance of the algorithms. …”
Get full text
Get full text
Article -
20
Accelerating graph algorithms with priority queue processor
Published 2006“…Of the various graph algorithms, techniques for searching a graph are the heart of graph algorithms. …”
Get full text
Get full text
Article
