Search Results - optimal ((((graph algorithm) OR (((cpdod algorithm) OR (bayes algorithm))))) OR (based algorithm))
Search alternatives:
- graph algorithm »
- cpdod algorithm »
- bayes algorithm »
-
1
Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization
Published 2019“…Consequently, during peak hours, finding a vacant parking bay is more of a difficult task. This study proposes a car parking management system which applies Dijkstra’s algorithm, Ant Colony Optimization (ACO) and Binary Search Tree (BST) in structuring a guidance system for indoor parking. …”
Get full text
Get full text
Thesis -
2
Ant colony optimization based subset feature selection in speech processing: Constructing graphs with degree sequences
Published 2024journal::journal article -
3
Synthesis of transistor-chaining algorithm for CMOS cell layout using bipartite graph / Azizi Misnan
Published 1997“…Searching for possible abutment between the transistor pairs are modelled as a bipartite graph. A depth - first search algorithm is used to search for optimal chaining. …”
Get full text
Get full text
Thesis -
4
Intelligent web proxy cache replacement algorithm based on adaptive weight ranking policy via dynamic aging
Published 2016“…However, their performances are not well optimized. This work proposes a hybrid method that optimize cache replacement algorithm using Naïve Bayes (NB) based approach. …”
Get full text
Get full text
Get full text
Article -
5
African Buffalo Optimization (ABO): A New Metaheuristic Algorithm
Published 2015“…The African Buffalo Optimization (A.B.0) algorithm simulates the African buffalos' behaviour by encapsulation in a mathematical model; which solves a number of discrete optimization problems using graph-based route planning, job scheduling and it extends Swarm Intelligence paradigms. …”
Get full text
Get full text
Get full text
Article -
6
Enhancing Classification Algorithms with Metaheuristic Technique
Published 2024“…In its operation, the metaheuristic algorithm optimizes the feature selection process,which will later be processed using the classification algorithm.Three (3) meta-heuristics were implemented, namely Genetic Algorithm, Particle Swarm Optimization, and Cuckoo Search Algorithm; the experiment was conducted, and the results were collected and analyzed. …”
Get full text
Get full text
Get full text
Article -
7
Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator: article
Published 2010“…The Smith-Waterman is been simplified into four modules which were initialization, score calculation, matrix filling and optimal path. The scope of the paper based on optimal path trace back using graph theory. …”
Get full text
Get full text
Article -
8
Approximate methods for minimum vertex cover fail to provide optimal results on small graph instances: A review
Published 2018“…The key contribution of this paper is the provision of small benchmark graphs on which the given approximation algorithms fail to provide optimal results. …”
Get full text
Get full text
Get full text
Get full text
Article -
9
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 -
10
Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator
Published 2010“…The Smith-Waterman is been simplified into four modules which were initialization, score calculation, matrix filling and optimal path. The scope of the paper based on optimal path trace back using graph theory. …”
Get full text
Get full text
Student Project -
11
Ant colony optimization algorithm for load balancing in grid computing
Published 2012“…The proposed algorithm is known as the enhance ant colony optimization (EACO). …”
Get full text
Get full text
Get full text
Monograph -
12
VISUALIZATION OF GENETIC ALGORITHM BASED ON 2-D GRAPH TO ACCELERATE THE SEARCHING WITH HUMAN INTERVENTIONS.
Published 2012“…It is noted that active user intervention increases the acceleration of Genetic Algorithm towards an optimal solution. In proposed research work, the user is aided by a visualization based on the representation of multidimensional Genetic Algorithm data on 2-0 space. …”
Get full text
Get full text
Thesis -
13
A comparative study of greedy algorithms and dynamic programming in road network / Nuralya Sofea Hairulanuar
Published 2024“…The Bellman Ford algorithm is notable for its capability to manage graphs with negative weights, however it is less efficient than Dijkstra's algorithm for graphs with non-negative weights. …”
Get full text
Get full text
Thesis -
14
Modeling of static and dynamic components of bio-nanorobotic systems
Published 2012“…In addition, a graph algorithm based on greedy methods is employed to compute a new set of optimal weighted electronic properties of the fullerenes via computing their Minimum Weight Spanning Trees (MWSTs). …”
Get full text
Get full text
Thesis -
15
An online density-based clustering algorithm for data stream based on local optimal radius and cluster pruning
Published 2019“…In this study, a fully online density-based clustering algorithm called Buffer-based Online Clustering for Evolving Data Stream (BOCEDS) is presented. …”
Get full text
Get full text
Thesis -
16
-
17
Max degree around (MDA) algorithm: a smart and efficient approximate algorithm for Vertex cover and independent set problems
Published 2016“…Hence, these approaches regularly fail to provide optimal results on specific graph instances. These problems motivated to propose Max Degres Around (MDA) approximation algorithm for the MVC problem. …”
Get full text
Get full text
Get full text
Article -
18
Multi-objective pareto ant colony system based algorithm for generator maintenance scheduling
Published 2022“…Friedman test using GRG metric shows significant better performance (p-values<0.05) for PACS algorithm compared to benchmark algorithms. The proposed models and algorithm can be used to solve the multi-objective GMS problem while the new parameters’ values can be used to obtain optimal or near optimal maintenance scheduling of generators. …”
Get full text
Get full text
Get full text
Thesis -
19
Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing
Published 2011“…A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against existing grid resource management algorithms such as Antz algorithm, Particle Swarm Optimization algorithm, Space Shared algorithm and Time Shared algorithm, in terms of processing time and resource utilization. …”
Get full text
Get full text
Get full text
Thesis -
20
A Hybrid ACO-Graph Entropy for Functional Modules Detection From Protein-Protein Interaction Network
Published 2018“…The Ant Colony Optimization (ACO) Algorithm has been adapted for the protein functional module detection by modeling the problem as an optimization problem. …”
Get full text
Get full text
Get full text
Article
