Search Results - (( java implementation modified algorithm ) OR ( using graph using algorithm ))

Direct approach for mining association rules from structured XML data by Abazeed, Ashraf Riad

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

Accelerating graph algorithms with priority queue processor by Heng Sun, Ch'ng, Eik Wee, Chew, Shaikh-Husin, Nasir, Hani, Mohamed Khalil

“…Of the various graph algorithms, techniques for searching a graph are the heart of graph algorithms. …”
Get full text
Get full text

Evolutionary cost-cognizant regression test case prioritization for object-oriented programs by Bello, AbdulKarim

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

OPTIMIZED MIN-MIN TASK SCHEDULING ALGORITHM FOR SCIENTIFIC WORKFLOWS IN A CLOUD ENVIRONMENT by Murad S.S., Badeel R., Alsandi N.S.A., Alshaaya R.F., Ahmed R.A., Muhammed A., Derahman M.

“…To achieve this, we propose a new noble mechanism called Optimized Min-Min (OMin-Min) algorithm, inspired by the Min-Min algorithm. The objectives of this work are: i) to provide a comprehensive review of the cloud and scheduling process; ii) to classify the scheduling strategies and scientific workflows; iii) to implement our proposed algorithm with various scheduling algorithms (i.e., Min-Min, Round-Robin, Max-Min, and Modified Max-Min) for performance comparison, within different cloudlet sizes (i.e., small, medium, large, and heavy) in three scientific workflows (i.e., Montage, Epigenomics, and SIPHT); and iv) to investigate the performance of the implemented algorithms by using CloudSim. …”

Graph coloring program of exam scheduling modeling based on bitwise coloring algorithm using python by Arifin, Samsul, Muktyas, Indra Bayu, Al Maki, Wikky Fawwaz, Mohd Khairul Bazli, Mohd Aziz

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

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

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

Multiregion segmentation of mammogram images by using parametric kernel graph cut algorithm / Nurhanani Abdul Rahim, Nor Farah Nabilah Mushtafa and Nadhirah Afiqah Zailan by Abdul Rahim, Nurhanani, Mushtaf, Nor Farah Nabilah, Zailan, Nadhirah Afiqah

“…Therefore, Parametric Kernel Graph Cut Algorithm was used in this study. Parametric Kernel Graph Cut Algorithm is an improvisation of the original Graph Cut. …”
Get full text
Get full text

Synthesis of transistor-chaining algorithm for CMOS cell layout using bipartite graph / Azizi Misnan by Misnan, Azizi

“…Searching for possible abutment between the transistor pairs are modelled as a bipartite graph. A depth - first search algorithm is used to search for optimal chaining. …”
Get full text
Get full text

Frequent itemset mining using graph theory / Mohammad Arsyad Mohd Yakop by Mohd Yakop, Mohammad Arsyad

“…_We proposed a novel frequent itemset mining using a graph theory called Frequent Row Graph Closed (FRG-Closed). …”
Get full text
Get full text

Optimizing boarding school schedule using graph coloring: case study of Sekolah Menengah Sultan Abdul Halim / Nur Farhana Mohd Asri by Mohd Asri, Nur Farhana

“…Greedy Algorithm is used to solve the Vertex Coloring approach meanwhile Graph Coloring Algorithm is used to solve the Edge Coloring approach. …”
Get full text
Get full text

Optimizing boarding school schedule using graph colouring : case study of Sekolah Menengah Sultan Abdul Halim / Nur Farhana Mohd Asri by Mohd Asri, Nur Farhana

“…Greedy Algorithm is used to solve the Vertex Coloring approach meanwhile Graph Coloring Algorithm is used to solve the Edge Coloring approach. …”
Get full text
Get full text

Identification of power poles based on satellite stereo images using graph-cut algorithm by Qayyum, Abdul, Malik, Aamir Saeed, Mohamad Saad, Mohamad Naufal, Ahmad, Rana Fayyaz, Taun Abdullah, Taun Ab Rashid

“…In conclusion, based on the results, Our proposed Graph-Cut algorithm produces more accurate disparity maps than the existing matching algorithm used for disparity calculation.…”
Get full text
Get full text

Prevention And Detection Mechanism For Security In Passive Rfid System by Khor, Jing Huey

“…The proposed protocol is designed with lightweight cryptographic algorithm, including XOR, Hamming distance, rotation and a modified linear congruential generator (MLCG). …”
Get full text
Get full text

Implement edge pruning to enhance attack graph generation using the naïve approach algorithm by Al-Araji, Zaid J., Mutlag, Ammar Awad, Syed Ahmad, Sharifah Sakinah

“…The attack graph is categorized into three sections: generation, analysis, and use of attack graph. …”
Get full text
Get full text
Get full text
Get full text

Attack graph construction for enhancing intrusion prediction based on vulnerabilities metrics by Al-Araji, Zaid Jasim Mohammed

“…The attack graph is categorized into three sections: generation, analysis, and use of attack graph. …”
Get full text
Get full text
Get full text

Find the maximum clique by graph coloring using heuristic greedy by Mustafa, Mamat, Suyudi, ., Sukono, ., Bon, A.T.

“…In this paper, Graph coloring used for to find maximum clique in a graph with heuristic greedy…”
Get full text
Get full text

Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator: article by Othman, Nor Shuhaida

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

Automatic generation of content security policy to mitigate cross site scripting by Mhana, Samer Attallah, Din, Jamilah, Atan, Rodziah

“…It can be extended to support generating CSP for contents that are modified by JavaScript after loading. Current approach inspects the static contents of URLs.…”
Get full text
Get full text

Graph algorithm vertex coloring by Suyudi, M., Sukono, ., Mustafa, Mamat, Bon, A.T.

“…A vertex coloring algorithm has been presented. As a result of applying vertex coloring algorithm no two vertex are to be allocated in same color if they are adjacent in graph. …”
Get full text
Get full text

Solving the minimum dominating set problem of partitioned graphs using a hybrid bat algorithm by Abed, S.A., Rais, H.M.

Get full text
Get full text