Search Results - (( developing development graph algorithm ) OR ( java application system algorithm ))
Search alternatives:
- development graph »
- java application »
- system algorithm »
- graph algorithm »
-
1
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 -
2
Ant colony optimization algorithm for load balancing in grid computing
Published 2012“…Global pheromone update is performed after the completion of processing the jobs in order to reduce the pheromone value of resources.A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against other ant based algorithm, in terms of resource utilization. …”
Get full text
Get full text
Get full text
Monograph -
3
Resource management in grid computing using ant colony optimization
Published 2011“…Resources with high pheromone value are selected to process the submitted jobs.Global pheromone update is performed after completion processing the jobs in order to reduce the pheromone value of resources.A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against other ant based algorithm, in terms of resource utilization.Experimental results show that EACO produced better grid resource management solution.…”
Get full text
Get full text
Get full text
Get full text
Monograph -
4
-
5
Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator: article
Published 2010“…The scope of the paper based on optimal path trace back using graph theory. The kind of graph theory that been used was indirected graph with linear algebra. …”
Get full text
Get full text
Article -
6
Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator
Published 2010“…The scope of the paper based on optimal path trace back using graph theory. The kind of graph theory that been used was indirected graph with linear algebra. …”
Get full text
Get full text
Student Project -
7
Provider independent cryptographic tools
Published 2003Get full text
Get full text
Get full text
Monograph -
8
-
9
Graph coloring program of exam scheduling modeling based on bitwise coloring algorithm using python
Published 2022“…The researchers develop a graph coloring algorithm by considering some of the graph vertices to be binary numbers. …”
Get full text
Get full text
Get full text
Article -
10
An improved algorithm for channel allocation on direct sequence spread spectrum
Published 2011“…Meanwhile between the VMA and Dsatur algorithm in the complex graph is equivalent to 18.1%.However,VMA and Welsh Powell algorithm is not compared in the complex graph since its drawback in terms of not fulfill the graph coloring concept.This is because there are two adjacent vertices have the same color.Overall, even there is no reduction for number of required channel among VMA,Dsatur algorithm and Welsh Powell algorithm in the simple graph,but the outstanding significant contribution of VMA since it has reduction in the complex graph.…”
Get full text
Get full text
Thesis -
11
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 -
12
An Improved-Time Polynomial-Space Exact Algorithm For TSP In Degree-5 Graphs
Published 2017“…Following a recent trend of research which focuses on developing algorithms for special types of TSP instances, namely graphs of limited degree, in an attempt to reduce a part of the time and space complexity, we present a polynomial-space branching algorithm for the TSP in an n-vertex graph with degree at most 5, and show that it has a running time of O∗(2.3500n), which improves the previous best known time bound of O∗(2.4723n) given by the authors (the 12th International Symposium on Operations Research and Its Application (ISORA 2015), pp.45–58, 2015). …”
Get full text
Get full text
Get full text
Get full text
Article -
13
Graph processing hardware accelerator for shortest path algorithms in nanometer very large-scale integration interconnect routing
Published 2007“…Graphs are pervasive data structures in computer science, and algorithms working with them are fundamental to the field. …”
Get full text
Get full text
Get full text
Thesis -
14
Butterfly Triple System Algorithm Based on Graph Theory
Published 2022“…Basically, in this algorithm development, a starter of cyclic near-resolvable ((v-1)/2)-cycle system of the 2-fold complete graph 2Kvis employed to construct the starter of cyclic ((v-1)/2)-star decomposition of 2Kv. …”
Get full text
Get full text
Get full text
Article -
15
Graph-Based Algorithm With Self-Weighted And Adaptive Neighbours Learning For Multi-View Clustering
Published 2024“…To address the noise problem in multi-view data, this study enhances the gbs method and develops a new self-weighted graph multi-view clustering algorithm (swmcan). …”
Get full text
Get full text
Thesis -
16
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 -
17
Parameter estimation of multivariable system using Fuzzy State Space Algorithm / Razidah Ismail … [et al.]
Published 2011“…The initial phase involved the development of the FSSM of the superheater system. In order to enhance the implementation of the algorithm, it is necesssary to develop an efficient computation program together with the user's interface. …”
Get full text
Get full text
Research Reports -
18
Ant colony optimization based subset feature selection in speech processing: Constructing graphs with degree sequences
Published 2024journal::journal article -
19
Static and dynamic graphs modeling of a boiler system / Noor Ainy Harish
Published 2015“…These results lead to the development of the third graph which represent a combination of the two processes in the boiler. …”
Get full text
Get full text
Thesis -
20
COVID-19 DATA EXPLORATION USING MAPPER ALGORITHM
Published 2023“…The resulting mapper graphs reveal the pandemic’s development progress across time and place during year 2021. …”
Get full text
Get full text
Final Year Project Report / IMRAD
