Search Results - (( java implementation modified algorithm ) OR ( using permutation parallel algorithm ))
Search alternatives:
- implementation modified »
- permutation parallel »
- java implementation »
- using permutation »
-
1
The division free parallel algorithm for finding determinant
Published 2013“…A cross multiplication method for determinant was generalized for any size of square matrices using a new permutation strategy.The permutation is generated based on starter sets.However, via permutation, the time execution of sequential algorithm became longer.Thus, in order to reduce the computation time, a parallel strategy was developed which is suited for master and slave paradigm of the high performance computer.A parallel algorithm is integrated with message passing interface.The numerical results showed that the parallel methods computed the determinants faster than the sequential counterparts particularly when the tasks were equally allocated.…”
Get full text
Get full text
Get full text
Article -
2
A new parallel model for starter sets generation via exchanging two elements
Published 2019“…In this study, a technique of parallelization across the method was employed to develop new parallel algorithm for finding all permutations under exchanged restrictions. …”
Get full text
Get full text
Article -
3
Parallel Optical Window Algorithm Applied to Optical Multistage Interconnection Network
Published 2008“…In this paper, a new parallel algorithm of the window method is developed called the Balanced Parallel Window Method (BPWM) algorithm. …”
Get full text
Get full text
Article -
4
Efficient Sequential and Parallel Routing Algorithms in Optical Multistage Interconnection Network
Published 2005“…This routing problem is an NPhard problem. Many algorithms are designed by many researchers to perform this routing such as window method, sequential algorithm, degree-descending algorithm, simulated annealing algorithm, genetic algorithm and ant colony algorithm.This thesis explores two approaches, sequential and parallel approaches. …”
Get full text
Get full text
Thesis -
5
New Sequential and Parallel Division Free Methods for Determinant of Matrices
Published 2013“…The computation times in the newly developed sequential methods were dominated by generating starter sets. Therefore, two parallel strategies were developed to parallelise this algorithm so as to reduce the computation times. …”
Get full text
Get full text
Get full text
Thesis -
6
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 -
7
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 -
8
Bitwise-based Routing Algorithms in Optical Multistage Interconnection Network
Published 2007“…Under the constraint of avoiding crosstalk, the interests of these algorithms are to find a permutation that uses a minimum number of passes and minimum execution time. …”
Get full text
Get full text
Thesis -
9
Zero Algorithms for Avoiding Crosstalk in Optical Multistage Interconnection Network
Published 2005“…In Zero algorithms, there are three types of algorithms namely; The Zero X, Zero Y and zeroXY algorithms. …”
Get full text
Get full text
Thesis -
10
Greedyzero-based scheduling algorithm to route in optical low stage interconnection networks
Published 2012“…Under the constraint of avoiding crosstalk, what we have been interested is how to realize a permutation that will use the minimum number of passes, the minimum execution time and the maximum bandwidth to route the input request to output without crosstalk. …”
Get full text
Get full text
Thesis -
11
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 -
12
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 -
13
A Simulated Annealing-Based Hyper-Heuristic For The Flexible Job Shop Scheduling Problem
Published 2023“…Flexible job shop scheduling problem (FJSP) is a common optimisation problem in the industry. The use of parallel machines allows an operation to be executed on a machine assigned from a set of alternative machines, raising a combination of machine assignment and job sequencing sub-problems. …”
Get full text
Get full text
Thesis -
14
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 -
15
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 -
16
Fuzzy-based multi-agent approach for reliability assessment and improvement of power system protection
Published 2015“…Meanwhile, the second MAS model has been designed using two agents as follows: the first agent is a fault current agent that is to determine the fault current at all points before and after grounding; the second agent is the time operating of the agent which is used to determine the relay operating time before and after modifying fault current. The simulation results for the first and second models are done using the data obtained from Malaysia distribution network (DISCO-Net) and 69 bus test system that were implemented using Java Agent Development Framework package software. …”
Get full text
Get full text
Thesis -
17
Evolutionary cost-cognizant regression test case prioritization for object-oriented programs
Published 2019“…There is also a need to consider implementing this strategy for dynamic object-oriented languages such as Python, Lisp, and Smalltalk.…”
Get full text
Get full text
Thesis
