Search Results - (( java implementation modified algorithm ) OR ( using interactive processes algorithm ))
Search alternatives:
- implementation modified »
- java implementation »
- processes algorithm »
- interactive »
-
1
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 -
2
OPTIMIZED MIN-MIN TASK SCHEDULING ALGORITHM FOR SCIENTIFIC WORKFLOWS IN A CLOUD ENVIRONMENT
Published 2023“…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. …”
Review -
3
Prevention And Detection Mechanism For Security In Passive Rfid System
Published 2013“…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
Thesis -
4
Automatic generation of content security policy to mitigate cross site scripting
Published 2016“…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
Conference or Workshop Item -
5
A comparative study on testing optimization techniques with combinatorial interaction testing for optimizing software product line testing
Published 2025“…By using the best optimization algorithm with the optimum number of interaction strengths, the complexity of the SPL testing process could be reduced without prejudicing the quality of the software system itself.…”
Get full text
Get full text
Get full text
Article -
6
Effects of Different Superpixel Algorithms on Interactive Segmentations
Published 2022“…Though employed as pre-processing step in many interactive segmentation algorithms, to date, no study has been conducted to assess the effects of such incorporations on the segmentation algorithms. …”
Get full text
Get full text
Get full text
Article -
7
Effects of Different Superpixel Algorithms on Interactive Segmentations
Published 2022“…Though employed as pre-processing step in many interactive segmentation algorithms, to date, no study has been conducted to assess the effects of such incorporations on the segmentation algorithms. …”
Get full text
Get full text
Get full text
Get full text
Get full text
Article -
8
Sizes of Superpixels and their Effect on Interactive Segmentation
Published 2021“…Despite the fact that it is used as a pre-processing step in many interactive segmentation algorithms, less studies had been conducted to assess the effects of the size of superpixels required by interactive segmentation algorithms to achieve an optimal result. …”
Get full text
Get full text
Get full text
Get full text
Proceedings -
9
Sizes of Superpixels and their Effect on Interactive Segmentation
Published 2021“…Despite the fact that it is used as a pre-processing step in many interactive segmentation algorithms, less studies had been conducted to assess the effects of the size of superpixels required by interactive segmentation algorithms to achieve an optimal result. …”
Get full text
Get full text
Get full text
Proceeding -
10
Efficient prime-based method for interactive mining of frequent patterns.
Published 2011“…During the mining process, the mining algorithm reduces the number of candidate patterns and comparisons by using a new candidate set called candidate head set and several efficient pruning techniques. …”
Get full text
Get full text
Article -
11
VISUALIZATION OF GENETIC ALGORITHM BASED ON 2-D GRAPH TO ACCELERATE THE SEARCHING WITH HUMAN INTERVENTIONS.
Published 2012“…Visualization techniques help in understanding the searching behaviour of Genetic Algorithm. lt also makes possible the user interactions during the searching process. …”
Get full text
Get full text
Thesis -
12
On Adopting Parameter Free Optimization Algorithms for Combinatorial Interaction Testing
Published 2015“…Although useful, strategies based on the aforementioned optimization algorithms are not without limitation. …”
Get full text
Get full text
Get full text
Article -
13
SYSTEM IDENTIFICATION AND MODEL PREDICTIVE CONTROL FOR INTERACTING SERIES PROCESS WITH NONLINEAR DYNAMICS
Published 2009“…The study is carried out by experimental works using the gaseous pilot plant as the process. The gaseous pilot plant exhibits the typical dynamic of an interacting series process, where the strong interaction between upstream and downstream properties occurs in both ways. …”
Get full text
Get full text
Thesis -
14
-
15
Adaptive persistence layer for synchronous replication (PLSR) in heterogeneous system
Published 2011“…The PLSR architecture model, workflow and algorithms are described. The PLSR has been developed using Java Programming language. …”
Get full text
Get full text
Thesis -
16
Superpixel Sizes using Topology Preserved Regular Superpixel Algorithm and their Impacts on Interactive Segmentation
Published 2022“…It is possible to speed up and improve the end result of segmentation by using pre-processing steps. The use of superpixels is an example of a pre-processing step. …”
Get full text
Get full text
Get full text
Get full text
Get full text
Article -
17
Enhancing Harmony Search Metaheuristic Algorithm for Coverage Efficiency, Test Suite Reduction, and Running Time in Combinatorial Interaction Testing
Published 2025“…By systematically covering combinations of input values, CIT can uncover faults that arise from complex interactions. One key aspect of CIT is coverage efficiency, which ensures that the desired interaction coverage is achieved with the fewest possible test cases, optimizing the testing process. …”
Get full text
Get full text
Article -
18
Superpixel Sizes using Topology Preserved Regular Superpixel Algorithm and their Impacts on Interactive Segmentation
Published 2022“…It is possible to speed up and improve the end result of segmentation by using pre-processing steps. The use of superpixels is an example of a pre-processing step. …”
Get full text
Get full text
Get full text
Article -
19
Segmentation of MRI brain images using statistical approaches
Published 2011“…Moreover, three improvements of EM for brain MRI segmentation are proposed, which incorporate neighbourhood information in a new manner in the clustering process. In addition, two algorithms for the post-processing of clustering results using user-interaction and the re-evaluation of boundary data in each cluster are presented. …”
Get full text
Get full text
Thesis -
20
Multi-queue CPU Process Prioritization using a Dynamic Quantum Time Algorithm Compared with Varying Time Quantum and Round-Robin Algorithms
Published 2016“…In this study, we propose a priority multi queues algorithm with dynamic quantum time. The algorithm uses multi queues with different quantum times for the processes. …”
Get full text
Get full text
Get full text
Article
