Search Results - (( developing using graph algorithm ) OR ( java implementation using algorithm ))
Search alternatives:
- implementation using »
- java implementation »
- developing using »
- graph algorithm »
- using algorithm »
-
1
Implementation of locust inspired scheduling algorithm with huge number of servers for energy efficiency in a cloud datacenter
Published 2019“…Cloudsim is used as Discrete Event Simulation tool and Java as coding language to evaluate LACE algorithm. …”
Get full text
Get full text
Thesis -
2
RSA Encryption & Decryption using JAVA
Published 2006“…References and theories to support the research of 'RSA Encryption/Decryption using Java' have been disclosed in Literature Review section. …”
Get full text
Get full text
Final Year Project -
3
Provider independent cryptographic tools
Published 2003“…The library is implemented by using Java cryptographic service provider framework that conforms to Java Cryptographic Architecture (JCA) and Java Cryptographic Extension (JCE). …”
Get full text
Get full text
Get full text
Monograph -
4
Direct approach for mining association rules from structured XML data
Published 2012“…The thesis also provides a two different implementation of the modified FLEX algorithm using a java based parsers and XQuery implementation. …”
Get full text
Get full text
Thesis -
5
Plagiarism Detection System for Java Programming Assignments by Using Greedy String-Tilling Algorithm
Published 2008“…The prototype system, known as Java Plagiarism Detection System (JPDS) implements the Greedy-String-Tiling algorithm to detect similarities among tokens in a Java source code files. …”
Get full text
Get full text
Get full text
Thesis -
6
Performance evaluation of real-time multiprocessor scheduling algorithms
Published 2016“…We hyave used the CPU profiler of Oracle JavaTM VisualVM to monitor the execution of LRE-TL as well as USG algorithms. …”
Get full text
Get full text
Conference or Workshop Item -
7
Automatic Number Plate Recognition on android platform: With some Java code excerpts
Published 2016“…On the other hand, the traditional algorithm using template matching only obtained 83.65% recognition rate with 0.97 second processing time. …”
Get full text
Get full text
Get full text
Book -
8
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 -
9
An improved algorithm for channel allocation on direct sequence spread spectrum
Published 2011“…Graph coloring is a useful algorithm for channel allocation on Direct Sequence Spread Spectrum (DSSS).Through this algorithm,each access point (AP) that adjacent gives different channels based on colors available.Welsh Powell algorithm and Degree of saturation (Dsatur) are the popular algorithms being used for channel allocation in this domain. …”
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: 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 -
11
Audio Streaming System Using Real-Time Transport Protocol Based on Java Media Framework
Published 2004“…Java Media Framework library and the RTP protocol for audio transmission were used as development tools.The developed system designed in this thesis together with experimental results proved that the system could be implemented successfully. …”
Get full text
Get full text
Thesis -
12
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 -
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
Evolutionary cost-cognizant regression test case prioritization for object-oriented programs
Published 2019“…The recent trend of software development uses OO paradigm. Therefore, this study proposed a cost-cognizant TCP approach for object-oriented software that uses path-based integration testing to identify the possible execution path extracted from the Java System Dependence Graph (JSDG) model of the source code using forward slicing technique. …”
Get full text
Get full text
Thesis -
15
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 -
16
Ant colony optimization based subset feature selection in speech processing: Constructing graphs with degree sequences
Published 2024journal::journal article -
17
Café Web Based System Using Priority Scheduling Approach
Published 2017“…The system is implemented at UniSZA’s café where two different types of user will use the system. …”
Get full text
Get full text
Conference or Workshop Item -
18
A Toolkit for Simulation of Desktop Grid Environment
Published 2014“…A simulator for desktop grid environment has been developed using Java as the implementation language due to its wide popularity. …”
Get full text
Get full text
Final Year Project -
19
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 -
20
An Improved-Time Polynomial-Space Exact Algorithm For TSP In Degree-5 Graphs
Published 2017“…In the analysis of the running time, we use the measure-and-conquer method, and we develop a set of branching rules which foster the analysis of the running time.…”
Get full text
Get full text
Get full text
Get full text
Article
