Search Results - (( using permutation parallel algorithm ) OR ( java iteration method algorithm ))
Search alternatives:
- permutation parallel »
- using permutation »
- iteration method »
- method algorithm »
- java »
-
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
Path planning for unmanned aerial vehicle (UAV) using rotated accelerated method in static outdoor environment
Published 2021“…The algorithm is implemented in a self-developed 2D Java tool, UAV Planner. …”
Get full text
Get full text
Get full text
Get full text
Article -
7
Application of genetic algorithm and JFugue in an evolutionary music generator
Published 2025“…This project explores the application of Genetic Algorithms (GA) with JFugue, which is a Java-based music programming library to develop an Evolutionary Music Generator. …”
Get full text
Get full text
Final Year Project / Dissertation / Thesis -
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
SecPath: Energy efficient path reconstruction in wireless sensor network using iterative smoothing
Published 2019“…This work uses iterative smoothing algorithm to find an alternative path with less distance and energy consumption. …”
Get full text
Get full text
Thesis -
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
Mathematical simulation for 3-dimensional temperature visualization on open source-based grid computing platform
Published 2009“…New Iterative Alternating Group Explicit (NAGE) is a powerful parallel numerical algorithm for multidimensional temperature prediction. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
13
Volunteer Management System
Published 2012“…The project will adopt the Iterative and incremental development methodology, which promotes constant reevaluation, and will be built on the java programming language and developed on the Netbeans IDE, for the GUI and algorithm implementation. …”
Get full text
Get full text
Final Year Project -
14
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 -
15
Smart student timetable planner
Published 2025“…Timetable planning is a crucial yet challenging task for university students, as traditional manual methods are often time-consuming, prone to errors, and lack collaborative support. …”
Get full text
Get full text
Final Year Project / Dissertation / Thesis -
16
Energy efficient path reconstruction in wireless sensor network using iPath
Published 2019“…Thus, the iPath by added the energy efficiency enables the reconstruction of the per-packet routing paths of large-scale networks, by providing a stable and efficient route to exchange messages between source and destination in a timely manner. This work uses iterative boosting algorithm to find an alternative path with less distance and energy consumption. …”
Get full text
Get full text
Get full text
Article
