Search Results - (( problem using ((graph algorithm) OR (tree algorithm)) ) OR ( java application based algorithm ))
Search alternatives:
- application based »
- java application »
- graph algorithm »
- tree algorithm »
-
1
Synthesis of transistor-chaining algorithm for CMOS cell layout using bipartite graph / Azizi Misnan
Published 1997“…This bound enables us to prune the search tree efficiently. The algorithm will be implemented and tested in this project using C language. …”
Get full text
Get full text
Thesis -
2
Predicting future sales using genetic algorithm: data mining sales / Siti Hajar Yaacob
Published 2014“…The main purpose of this research to test whether Genetic Algorithm can use to predict future sales and be able generates the graph. …”
Get full text
Get full text
Thesis -
3
Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing
Published 2011“…The resource allocation problem is modeled as a graph that can be used by the ant to deliver its pheromone. …”
Get full text
Get full text
Get full text
Thesis -
4
Ant colony optimization algorithm for load balancing in grid computing
Published 2012“…The resource allocation problem is modelled as a graph that can be used by the ant to deliver its pheromone.This graph consists of four types of vertices which are job, requirement, resource and capacity that are used in constructing the grid resource management element. …”
Get full text
Get full text
Get full text
Monograph -
5
On some packing and partition problems in geometric graphs
Published 2018“…Graph packing problem refers to the problem of finding maximum number of edge-disjoint copies of a fixed subgraph in a given graph G. …”
Get full text
Get full text
Thesis -
6
A hybrid algorithm for finding shortest path in network routing.
Published 2009“…Classical algorithms have been used to search over some space for finding the shortest paths problem between two points in a network and a minimal weight spanning tree for routing. …”
Get full text
Article -
7
Spanning Tree Transformation of Connected Graph into Single-Row Network
Published 2010“…Path-Growing Tree-Forming algorithm applied with Vertex-Prioritized is contained in the model to produce the spanning tree from the connected graph. …”
Get full text
Get full text
Conference or Workshop Item -
8
-
9
Resource management in grid computing using ant colony optimization
Published 2011“…Managing resources in grid computing system is complicated due to the distributed and heterogeneous nature of the resources.Stagnation in grid computing system may occur when all jobs require or are assigned to the same resources which lead to the resources having high workload or the time taken to process a job is high.This research proposes an Enhanced Ant Colony Optimization (EACO) algorithm that caters dynamic scheduling and load balancing in the grid computing system.The algorithm consists of three new mechanisms that organize the work of an ant colony i.e. initial pheromone value mechanism, resource selection mechanism and pheromone update mechanism.The resource allocation problem is modeled as a graph that can be used by the ant to deliver its pheromone.This graph consists of four types of vertices which are job, requirement, resource and capacity that are used in constructing the grid resource management element.The proposed EACO algorithm takes into consideration the capacity of resources and the characteristics of jobs in determining the best resource to process a job.EACO selects the resources based on the pheromone value on each resource which is recorded in a matrix form.The initial pheromone value of each resource for each job is calculated based on the estimated transmission time and execution time of a given job. …”
Get full text
Get full text
Get full text
Get full text
Monograph -
10
Quantum Processing Framework And Hybrid Algorithms For Routing Problems
Published 2010“…Another quantum algorithm for a minimum weight spanning tree in the graph was also designed. …”
Get full text
Get full text
Thesis -
11
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 -
12
Using modification of Prim's algorithm and GNU Octave and to solve the multiperiods installation problem
Published 2020“…The Minimum Spanning Tree (MST) is one of the famous problems that is used mostly as the backbone in many network design problems. …”
Get full text
Get full text
Get full text
Get full text
Get full text
Article -
13
Vegetation height estimation near power transmission poles via satellite stereo images using 3D depth estimation algorithms
Published 2023Conference Paper -
14
Vegetation height estimation near power transmission poles via satellite stereo images using 3D depth estimation algorithms
Published 2015“…We have compared the results of Pleiades satellite stereo images using dynamic programming and Graph-Cut algorithms, consequently comparing satellites’ imaging sensors and Depth-estimation Algorithms. …”
Get full text
Get full text
Conference or Workshop Item -
15
Adoption of machine learning algorithm for analysing supporters and non supporters feedback on political posts / Ogunfolajin Maruff Tunde
Published 2022“…Studies have shown how user perception can have a strong influence on policies and decision-making processes in a place, society, and nation. This thesis is based on the application of sentiment classification algorithm to tweet data with the goal of classifying messages based on the polarity of sentiment towards a particular topic (or subject matter). …”
Get full text
Get full text
Get full text
Thesis -
16
Improving performance of automated coronary arterial tree center-line extraction, stent localization and tracking
Published 2012“…Over the last decade, many algorithms have been developed to address this problem. …”
Get full text
Get full text
Thesis -
17
Mining Sequential Patterns Using I-PrefixSpan
Published 2007“…In this paper, we propose an improvement of pattern growth-based PrefixSpan algorithm, called I-PrefixSpan. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
18
Drone-based surveillance of palm tress ecosystems
Published 2024“…Furthermore, the loss graph exhibits a similar trend to the RMSE graph, corroborating the effectiveness of RMSE as a common loss function for regression problems. …”
Get full text
Get full text
Get full text
Article -
19
-
20
Graph processing hardware accelerator for shortest path algorithms in nanometer very large-scale integration interconnect routing
Published 2007“…Many challenging problems in Very Large-Scale Integration (VLSI) physical design automation are modeled using graphs. …”
Get full text
Get full text
Get full text
Thesis
