Search Results - (( developing call graph algorithm ) OR ( java implication based algorithm ))

An improved algorithm for channel allocation on direct sequence spread spectrum by Handrizal, M

“…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

Graph-Based Algorithm With Self-Weighted And Adaptive Neighbours Learning For Multi-View Clustering by He, Yanfang

“…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

Butterfly Triple System Algorithm Based on Graph Theory by Ibrahim, Haslinda, Aldiabat, Raja’i, Karim, Sharmila

“…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

An Improved of Channel Allocation for WLAN Using Vertex Merge Algorithm by Mr, Handrizal, Mr, Muhammad Zarlis, Noraziah, Ahmad, Abdalla, Ahmed N.

“…Graph colouring is a useful algorithm for channel allocation on wireless local area network (WLAN). …”
Get full text
Get full text

Scalable workflow scheduling algorithm for minimizing makespan and failure probability by Abdul Aziz, Maslina, Ninggal, Izuan Hafez

“…This paper presents an algorithm called Failure-Aware Workflow Scheduling (FAWS). …”
Get full text
Get full text
Get full text
Get full text

CAGDEEP : Mobile malware analysis using force atlas 2 with strong gravity call graph and deep learning by Nur Khairani, Kamarudin, Ahmad Firdaus, Zainal Abidin, Azlee, Zabidi, Mohd Faizal, Ab Razak

“…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

Computationally-efficient path planning algorithms in obstacle-rich environments based on visibility graph method by Abdul Latip, Nor Badariyah

“…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

Path planning for unmanned aerial vehicles using visibility line-based methods by Omar, Rosli

“…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

Algorithms for extracting adjacency matrix based on Formal Concept Analysis (FCA) by Hasni, Hassan, Aznida Hayati, Zakaria@Mohamad, Mohd Isa, Awang, Mokhairi, Makhtar, Rohana, Ismail, Fadhilah, Ahmad

“…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

Representation of half wing of butterfly and hamiltonian circuit for complete graph using starter set method by Karim, Sharmila, Ibrahim, Haslinda, Mohd Darus, Maizon

“…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

Aco-based feature selection algorithm for classification by Al-mazini, Hassan Fouad Abbas

“…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

Laser simulator: a novel search graph-based path planning approach by Ali, Mohammed A. H., Musa, Mailah

“…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

A novel deadlock detection algorithm for neighbour replication on grid environment by Noriyani, Mohd Zin

“…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

Examination timetable scheduling system (ETSS) / Fong Teng Heng by Fong, Teng Heng

“…The algorithm using can be referred to Graph colouring. …”
Get full text
Get full text

Design of DNA fragment assembly using IWP method on application-specific integrated-circuit / Hasniliati Hassan by Hassan, Hasniliati

“…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

MOSDA: A proposal for multiple objective spiral dynamics algorithm by A. R.A., Azwan, Ahmad Nor Kasruddin, Nasir, Sha'akmal, S., A.R.M., Sawal

“…It has a good elitism strategy and has a simple structure. A method called “archive method” that is used in multi-objective particle swarm optimization (MOPSO) is adopted into SDA to develop its multiobjective (MO) type algorithm. …”
Get full text
Get full text
Get full text

Energy efficient path-planning for unmanned aerial vehicle by Debnath, Sanjoy Kumar

“…The proposed path planning algorithm is called Iterative Elliptical- Convex Visibility Graph (IECoVG) which is based on visibility graph (VG) and Dijkstra’s algorithm. …”
Get full text
Get full text
Get full text
Get full text

Dijkstra’s algorithm in Product Searching System (ProSearch) / Nur Hasni Nasrudin ... [et al.] by Nasrudin, Nur Hasni, Nasaruddin, Siti Hajar, Syed Abdul Halim, Syarifah Syafiqah Wafa, Ahmad Junid, Rosida

“…The results from the survey have led to the development of ProSearch application system. ProSearch is a system that is developed by applying a graph search algorithm called Dijkstra Algorithm so as to find and identify the shortest path to reach the product. …”
Get full text
Get full text

A maximal-clique-based clustering approach for multi-observer multi-view data by using k-nearest neighbor with S-pseudo-ultrametric induced by a fuzzy similarity by Khameneh, Azadeh Zahedi, Ghaznavi, Mehrdad, Kilicman, Adem, Mahad, Zahari, Mardani, Abbas

“…Under this framework, different algorithms have been developed where the output relies on an exact distance calculated based on the objects’ features. …”
Get full text
Get full text

Development of Attendance Management Algorithm for analyzing rate of absenteeism by Tan Boon Tuck, Bachelor of Engineering Technology in Electronics