Search Results - (( developing call graph algorithm ) OR ( java application using algorithm ))
Search alternatives:
- java application »
- developing call »
- graph algorithm »
- using algorithm »
-
1
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 -
2
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 -
3
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 -
4
An Improved of Channel Allocation for WLAN Using Vertex Merge Algorithm
Published 2012“…Graph colouring is a useful algorithm for channel allocation on wireless local area network (WLAN). …”
Get full text
Get full text
Conference or Workshop Item -
5
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 -
6
-
7
Scalable workflow scheduling algorithm for minimizing makespan and failure probability
Published 2019“…This paper presents an algorithm called Failure-Aware Workflow Scheduling (FAWS). …”
Get full text
Get full text
Get full text
Get full text
Article -
8
Provider independent cryptographic tools
Published 2003Get full text
Get full text
Get full text
Monograph -
9
CAGDEEP : Mobile malware analysis using force atlas 2 with strong gravity call graph and deep learning
Published 2023“…The novelty of our study lies in the Force Atlas 2 call graph development to capture malware behavior patterns. …”
Get full text
Get full text
Get full text
Get full text
Conference or Workshop Item -
10
Computationally-efficient path planning algorithms in obstacle-rich environments based on visibility graph method
Published 2018“…In order to address the high computation time, an improved VG called Iterative Equilateral Spaces Oriented Visibility Graph (IESOVG) has been developed by reducing the number of obstacles used for path planning. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
11
Path planning for unmanned aerial vehicles using visibility line-based methods
Published 2011“…This thesis concerns the development of path planning algorithms for unmanned aerial vehicles (UAVs) to avoid obstacles in two- (2D) and three-dimensional (3D) urban environments based on the visibility graph (VG) method. …”
Get full text
Get full text
Thesis -
12
Algorithms for extracting adjacency matrix based on Formal Concept Analysis (FCA)
Published 2017“…However, the focus of the paper is on a method proposed to extract adjacency matrix from concepts obtained from the theory of Formal Concept Analysis (FCA) using two consecutive algorithms called the Relatedness Algorithm and Adjacency Matrix Algorithm. …”
Get full text
Get full text
Conference or Workshop Item -
13
Representation of half wing of butterfly and hamiltonian circuit for complete graph using starter set method
Published 2019“…Several interesting and challenging methods have used to formulate distinct circuits but this research is motivated through the process of wings movement in butterfly to develop distinct circuits from complete graphs. The beauty of method is using the concept of mirror image of the wings movement and this method in called Half Butterfly Method (HBM). …”
Get full text
Get full text
Get full text
Article -
14
Aco-based feature selection algorithm for classification
Published 2022“…The modified graph clustering ant colony optimisation (MGCACO) algorithm is an effective FS method that was developed based on grouping the highly correlated features. …”
Get full text
Get full text
Thesis -
15
Laser simulator: a novel search graph-based path planning approach
Published 2018“…A novel technique called laser simulator approach for visibility search graph-based path planning has been developed in this article to determine the optimum collision-free path in unknown environment. …”
Get full text
Get full text
Get full text
Article -
16
A novel deadlock detection algorithm for neighbour replication on grid environment
Published 2012“…The NRGDD simulation model has been developed to test the algorithm on NRG. Two experiments have been conducted to test the correctness of NRGDD algorithm. …”
Get full text
Get full text
Thesis -
17
Examination timetable scheduling system (ETSS) / Fong Teng Heng
Published 2000“…The algorithm using can be referred to Graph colouring. …”
Get full text
Get full text
Thesis -
18
Real-Time Video Processing Using Native Programming on Android Platform
Published 2012“…However for the Android platform that based on the JAVA language, most of the software algorithm is running on JAVA that consumes more time to be compiled. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
19
Direct approach for mining association rules from structured XML data
Published 2012Get full text
Get full text
Thesis -
20
Design of DNA fragment assembly using IWP method on application-specific integrated-circuit / Hasniliati Hassan
Published 2017“…After reviewing various algorithms, it was decided to apply de Bruijn graphs and Eulerian circuits that are based on graph theory. …”
Get full text
Get full text
Thesis
