Search Results - (optical OR optimal) graph algorithm
Search alternatives:
-
1
A GreedyZero algorithm to minimise the conflicts in an Optical Multistage Interconnection Network
Published 2014“…In this paper, we have proposed a new algorithm to minimise the number of conflicts of OMINs using the greedy graph colouring and Zero algorithm. …”
Get full text
Get full text
Get full text
Article -
2
A Fast Scheduling Algorithm for WDM Optical Networks
Published 2000“…An optimal edge colouring of bipartite multi graph can be found in O(M log2 N) time, where M is number of packets selected for scheduling, and N is the number of the nodes. …”
Get full text
Get full text
Thesis -
3
Ant colony optimization based subset feature selection in speech processing: Constructing graphs with degree sequences
Published 2024journal::journal article -
4
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 -
5
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 -
6
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 -
7
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 -
8
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 -
9
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 -
10
Graph theory approach for managing lecturers’ schedule using graph colouring method / Siti Nor Ba Basri, Nur Su’aidah Khozaid and Farhana Hazwani Ismail
Published 2023“…By using graph theory, graph colouring techniques, and ILP validation, this work optimizes lecturers' timetable scheduling, resolving conflicts, omissions, limitations, and preferences for optimal educational scheduling and resource allocation. …”
Get full text
Get full text
Student Project -
11
-
12
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 -
13
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 -
14
Optimizing kindergarten schedule using : graph coloring / Nur Nabilah Salleh Muner
Published 2019“…The greedy algorithm was used to color the graph and it was supported by the C++ program. …”
Get full text
Get full text
Research Reports -
15
Identification of power poles based on satellite stereo images using graph-cut algorithm
Published 2023“…Algorithms; Graphic methods; Image matching; Image processing; Optical radar; Poles; Satellite imagery; Satellites; Signal detection; Signal processing; Vegetation; Damage compensations; Electrical distribution; Graph cut; High voltage transmission lines; Monitoring methods; Stereo matching; Stereo matching algorithm; Stereo-image; Stereo image processing…”
Conference Paper -
16
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 -
17
Modeling of static and dynamic components of bio-nanorobotic systems
Published 2012“…The first modeling technique applies graph algorithms to compute a new set of optimal weighted structural properties of C60 and C70 fullerenes. …”
Get full text
Get full text
Thesis -
18
-
19
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 -
20
Using graph algorithm and classification technique for finding an optimal bus route in time-dependent travel times
Published 2016“…However, they are suffering from the long hours in traffic jam especially in rush hour.They also cannot avoid this such jam as bus routes are fixed by Bangkok Mass Transit Authority (BMTA).This paper aims to propose a technique for finding an Optimal Bus Route in Time-Dependent Travel Times by using graph algorithm and data mining technique. …”
Get full text
Get full text
Get full text
Conference or Workshop Item
