Search Results - (( java implementation modified algorithm ) OR ( causing problems _ algorithm ))
Search alternatives:
- implementation modified »
- java implementation »
- causing problems »
-
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
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 -
6
A refined differential evolution algorithm for improving the performance of optimization process
Published 2011“…Various Artificial Intelligent (AI) algorithms can be applied in solving optimization problems. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
7
Automatic clustering of gene ontology by genetic algorithm
Published 2006“…However, the increase in size of the Gene Ontology has caused problems in maintaining and processing them. …”
Get full text
Get full text
Article -
8
Tolerable Constructive Graph-Based Hyper-Heuristic Algorithm For Examination Timetabling
Published 2009“…In heuristic approaches getting stuck in local optimum is one of the propounded problems from early days. The main cause for the local optimal problem is that heuristic algorithms either focus on exploration (global improvement) rather than exploitation (local improvement) or vice versa.…”
Get full text
Get full text
Thesis -
9
-
10
An improved simulated annealing algorithm to avoid crosstalk in optical omega network
Published 2006“…When Simulated Annealing (SA) algorithm was used to solve the problem, it gave good results. …”
Get full text
Get full text
Conference or Workshop Item -
11
Challenges of hidden data in the unused area two within executable files
Published 2009“…Results: The programs were coded in Java computer language and implemented on Pentium PC. …”
Get full text
Get full text
Get full text
Article -
12
A novel layer by layer energy efficient watchman algorithm for wireless sensor and actor networks
Published 2021“…Energy consumption, end-to-end delay, and throughput are considered for the evaluation of the proposed algorithm. At the end, the proposed algorithm is compared with an existing state-of-the-art algorithm like the Efficient Traffic Load Reduction Algorithm (ETLRA) that also works with limbs node for the said problem in the same kind of wireless environment. …”
Get full text
Get full text
Article -
13
Festive season balancing groceries optimization / Fairuz Mohamed Razi
Published 2012“…An Artificial Intelligence method or technique is selected to provide a solution to this problem. The cause of the shortage in supply-demand is taken to be implemented in the Genetic Algorithms optimization concepts. …”
Get full text
Get full text
Thesis -
14
Heuristic-Based Ant Colony Optimization Algorithm For Protein Functional Module Detection In Protein Interaction Network
Published 2017“…Ant colony optimization (ACO) is a metaheuristic algorithm that has been successfully applied to several types of optimization problems such as scheduling, routing, and more recently for solving protein functional module detection (PFMD) problem in protein-protein interaction (PPI) networks. …”
Get full text
Get full text
Thesis -
15
Heuristic-Based Ant Colony Optimization Algorithm For Protein Functional Module Detection In Protein Interaction Network
Published 2017“…Ant colony optimization (ACO) is a metaheuristic algorithm that has been successfully applied to several types of optimization problems such as scheduling, routing, and more recently for solving protein functional module detection (PFMD) problem in protein-protein interaction (PPI) networks. …”
Get full text
Get full text
Thesis -
16
Minimizing makespan of a resource-constrained scheduling problem: a hybrid greedy and genetic algorithms
Published 2015“…Resource-Constrained Project Scheduling Problem (RCPSP) is considered as an important project scheduling problem. …”
Get full text
Get full text
Get full text
Article -
17
Leader election algorithm in 2D torus networks with the presence of one link failure
Published 2010“…Leader election algorithms solve the instability problem in the network which is caused by leader failure. …”
Get full text
Article -
18
Zero Algorithms for Avoiding Crosstalk in Optical Multistage Interconnection Network
Published 2005“…Under the constraint of avoiding crosstalk, the research interest is to realize a permutation that will use the minimum number of passes (to route the input request to output without crosstalk). This routing problem is an NP-hard problem. Many heuristic algorithms have been proposed and designed to perform the routing such as the sequential algorithm, the sequential down algorithm, the degree-ascending algorithm, the degree-descending algorithm, the Simulated Annealing algorithm and the Ant Colony algorithm. …”
Get full text
Get full text
Thesis -
19
Efficient Sequential and Parallel Routing Algorithms in Optical Multistage Interconnection Network
Published 2005“…Also an improved simulated annealing is proposed to solve the routing problem. The efficient combination of simulated annealing algorithm with the best heuristic algorithms gave much better result in a very minimal time. …”
Get full text
Get full text
Thesis -
20
Enhanced cell-based algorithm with dynamic radius in solving capacitated multi-source weber problem
Published 2021“…Capacitated Multi-source Weber Problem (CMSWP) is a type of Location Allocation Problem (LAP) which have been extensively researched because they can be applied in a variety of contexts. …”
Get full text
Get full text
Thesis
