Search Results - (( using permutation parallel algorithm ) OR ( java implementation some algorithm ))
Search alternatives:
- permutation parallel »
- java implementation »
- implementation some »
- using permutation »
- some algorithm »
-
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
Plagiarism Detection System for Java Programming Assignments by Using Greedy String-Tilling Algorithm
Published 2008“…The prototype system, known as Java Plagiarism Detection System (JPDS) implements the Greedy-String-Tiling algorithm to detect similarities among tokens in a Java source code files. …”
Get full text
Get full text
Get full text
Thesis -
7
-
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
Route Optimization System
Published 2005“…After much research into the many algorithms available, and considering some, including Genetic Algorithm (GA), the author selected Dijkstra's Algorithm (DA). …”
Get full text
Get full text
Final Year Project -
11
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 -
12
Design and Implementation of Data-at-Rest Encryption for Hadoop
Published 2017“…It is shown that the implementation of AES encryption algorithm is capable to secure data stored in HDFS to some extent.…”
Get full text
Get full text
Conference or Workshop Item -
13
Design and Implementation of Data-at-Rest Encryption for Hadoop
Published 2017“…It is shown that the implementation of AES encryption algorithm is capable to secure data stored in HDFS to some extent.…”
Get full text
Get full text
Conference or Workshop Item -
14
Web-based clustering tool using fuzzy k-mean algorithm / Ahmad Zuladzlan Zulkifly
Published 2019“…This project will use fuzzy k-means clustering algorithm to cluster the data because it is easy to implement and have many advantages. …”
Get full text
Get full text
Thesis -
15
Fuzzy modeling using Bat Algorithm optimization for classification
Published 2018“…A Sazonov Engine which is a fuzzy java engine is use to apply Bat Algorithm in the experiment. …”
Get full text
Get full text
Get full text
Undergraduates Project Papers -
16
Implementation of RIO in UMJaNetSim / Chan Chin We
Published 2004“…In this project, I will do some research on the recent TCP congestion control and avoidance mechanisms and implement one of the mechanisms into the Java Network Simulator (JaNetSim). …”
Get full text
Get full text
Thesis -
17
Comparison of performances of Jaya Algorithm and Cuckoo Search algorithm using benchmark functions
Published 2022“…This paper aims to compare the performance of two metaheuristic algorithms which are Jaya Algorithm (JA) and Cuckoo Search (CS) using some common benchmark functions. …”
Get full text
Get full text
Get full text
Get full text
Conference or Workshop Item -
18
Features selection for intrusion detection system using hybridize PSO-SVM
Published 2016“…The simulation will be carried on WEKA tool, which allows us to call some data mining methods under JAVA environment. …”
Get full text
Get full text
Thesis -
19
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 -
20
Priority and dynamic quantum time algorithms for central processing unit scheduling
Published 2018“…In excel, a graph has been produced to show the minimum and maximum values of the new dynamic quantum time after setting the parameters of the proposed formula (priority, burst time and the current quantum time). The proposed algorithms (Priority Dynamic Quantum Time and Multi Priority Dynamic Quantum Time Algorithms) are implemented using JAVA programming language and validated using Key Performance Indicators equations. …”
Get full text
Get full text
Thesis
