Search Results - optimal ((((((graph algorithm) OR (drops algorithm))) OR (tree algorithm))) OR (_ algorithm))
Search alternatives:
- graph algorithm »
- tree algorithm »
-
1
A comparative analysis of Prim, Kruskal, and Reverse-Delete algorithms in optimizing routes within Terengganu’s and Pahang’s attraction road network / Munashahira Mohammad Zahid
Published 2024“…The Reverse-Delete algorithm works in reverse; it starts with the full graph and iteratively removes the largest edges, ensuring that the graph remains connected. …”
Get full text
Get full text
Thesis -
2
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 -
3
Guidance system based on Dijkstra-ant colony algorithm with binary search tree for indoor parking system
Published 2021“…This solution depending on applying the optimization on an optimal path while the traditional ACO is optimizing the random path based on the greedy algorithm hence we get the most optimal path. …”
Get full text
Get full text
Get full text
Article -
4
-
5
Implication of image processing algorithm in remote sensing and GIS applications
Published 2011“…Minimum Spanning Tree (MST), the most functional algorithm, described exclusively by the undirected graph in which all nodes are connected. …”
Get full text
Get full text
Get full text
Article -
6
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 -
7
A matrix approach for minimum spanning tree in neutrosophic and application in medical waste management / Nur Haifa Ahmad Hayazim, Siti Nurain Zulkifli and Siti Nurhidayah Yaacob
Published 2022“…The problem of finding the minimum spanning tree (MST) is one of the most extensively studied and significant combinatorial optimization problems in graph theory. …”
Get full text
Get full text
Student Project -
8
Benchmark simulator with dynamic environment for job scheduling in grid computing
Published 2014“…Job scheduling algorithm has a significant influence on grid computing performance. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
9
Analysis and modeling of database storage optimization power consumption usage for green data centers
Published 2014“…The proxies can be discovered by using a developed algorithm of functional dependencies (FDs) called as TANE algorithm. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
10
Optimizing the light gradient-boosting machine algorithm for an efficient early detection of coronary heart disease
Published 2024“…Borderline-SMOTE (Synthetic Minority Over-sampling Technique) was used on the training set to balance the dataset. The LightGBM algorithm was selected for its efficiency in classification tasks, and Bayesian Optimization with Tree-structured Parzen Estimator (TPE) was employed to fine-tune its hyperparameters. …”
Get full text
Get full text
Get full text
Article -
11
Ant colony optimization based subset feature selection in speech processing: Constructing graphs with degree sequences
Published 2024Subjects: “…Ant colony optimization…”
journal::journal article -
12
Solving university examination timetabling problem using intelligent water drops algorithm
Published 2024Subjects: “…Intelligent water drops algorithm…”
Conference Paper -
13
Optimizing boarding school schedule using graph colouring : case study of Sekolah Menengah Sultan Abdul Halim / Nur Farhana Mohd Asri
Published 2021“…The result has shown that the Greedy Algorithm has succeeded to produce the lowest minimal color compared to Graph Coloring Algorithm. …”
Get full text
Get full text
Student Project -
14
Optimizing boarding school schedule using graph coloring: case study of Sekolah Menengah Sultan Abdul Halim / Nur Farhana Mohd Asri
Published 2022“…The result has shown that the Greedy Algorithm has succeeded to produce the lowest minimal color compared to Graph Coloring Algorithm. …”
Get full text
Get full text
Research Reports -
15
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 -
16
Intelligent Examination Timetabling System Using Hybrid Intelligent Water Drops Algorithm
Published 2024Subjects:Proceedings Paper -
17
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 -
18
A genetic algorithm approach to VLSI macro cell non-slicing floorplans using binary tree
Published 2008“…This algorithm demonstrates that SSGA converges to the optimal result faster than SGA and AGA. …”
Get full text
Get full text
Conference or Workshop Item -
19
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 -
20
Modified And Ensemble Intelligent Water Drop Algorithms And Their Applications
Published 2015“…The Intelligent Water Drop (IWD) algorithm is a swarm-based model that is useful for undertaking optimization problems. …”
Get full text
Get full text
Thesis
