Search Results - (( java application optimisation algorithm ) OR ( using generating permutation algorithm ))
Search alternatives:
- application optimisation »
- optimisation algorithm »
- permutation algorithm »
- java application »
- using generating »
-
1
Starter Set Generation Based on Factorial Numbers for Half Wing of Butterfly Representation
Published 2021“…This paper presents the use of factorial numbers for generating starter sets where starter sets are used for listing permutation. …”
Get full text
Get full text
Get full text
Article -
2
New recursive circular algorithm for listing all permutations
Published 2014“…Linear array of permutations is hard to be factorized.However, by using a starter set, the process of listing the permutations becomes easy. …”
Get full text
Get full text
Get full text
Article -
3
New recursive circular algorithm for listing all permutations
Published 2014“…Linear array of permutations is hard to be factorised. However, by using a starter set, the process of listing the permutations becomes easy. …”
Get full text
Get full text
Get full text
Article -
4
Comparison between starter sets generation method for listing all permutations
Published 2013“…Listing of all n! distinct permutations is an exhaustive process.Using starter set, the process of listing the permutations becomes easy.However a problem arises when the equivalence starter sets will generate the similar permutation and needed to be discarded.Two new recursive strategies are proposed to generate starter sets without generating equivalence starter sets namely circular and exchange two elements operation.Once the starter sets are obtained, the circular and reverse of circular operation are employed to produce distinct permutation from each starter sets.Computational advantages are presented comparing the results obtained by the new method with two other existing methods.The result indicates that the exchange two elements based strategy is faster than the circular based.Overall all new algorithms are better than existing algorithms in time execution.…”
Get full text
Get full text
Conference or Workshop Item -
5
-
6
A new parallel model for starter sets generation via exchanging two elements
Published 2019“…Generating permutation can be done in many ways. One of them is via starter sets which are obtained using exchange operation strategy and exploit them to list down all permutations. …”
Get full text
Get full text
Article -
7
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 -
8
A DNA-dynamic permutation-diffusion algorithm for image encryption using scaling chaotification models and advanced DNA operations
Published 2025“…To overcome these challenges, this paper proposes the DNA-Dynamic Concurrent Permutation-Diffusion Algorithm (DNA-DCP-DA), which introduces four advanced encryption mechanisms. …”
Get full text
Get full text
Get full text
Get full text
Article -
9
-
10
Dynamic S-boxes and spiral permutation function on Fibonacci sequence for secure block cipher / Kamsiah Mohamed
Published 2022“…In this thesis, the Spiral Fibonacci is proposed for a permutation function to diffuse bit permutation in improving cryptography algorithm efficiency. …”
Get full text
Get full text
Thesis -
11
Key schedule algorithm based on coordinate geometry of a three-dimensional hybrid cube
Published 2019“…A key schedule algorithm is the mechanism that generates and schedules all session-keys for the encryption process. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
12
Numerical assessment on makespan minimization by adopting NEH heuristics in permutation flow shop
Published 2015“…Whereas the process times of the jobs were randomly generated with range 1 to 10 using Microsoft Excel spreadsheet. …”
Get full text
Get full text
Conference or Workshop Item -
13
A block cipher based on genetic algorithm
Published 2016“…In many algorithms which are based on the genetic algorithm approach, diffusion properties using crossover and mutation function are being generated to produce a secure data transmission. …”
Get full text
Get full text
Get full text
Thesis -
14
Study and Implementation of Data Mining in Urban Gardening
Published 2019“…The system is essentially a three-part development, utilising Android, Java Servlets, and Arduino platforms to create an optimised and automated urban-gardening system. …”
Get full text
Get full text
Get full text
Article -
15
Modified Neh Heuristic On Makespan Reduction In Permutation Flow Shop Problems
Published 2015“…In this study, a total of 109 flow-shop problems were solved with the number of machines and jobs being set at a range of 4 to 25. 100 problems were carried out using numerical assessments. The process times of the jobs were randomly generated within the range of 1 to 10 using Excel spreadsheets. …”
Get full text
Get full text
Thesis -
16
Optimization of job scheduling in a machine shop using genetic algorithm
Published 2002“…A modified version of GA known as string GA has been used to get the near optimal cycle time for permutation analysis. …”
Get full text
Get full text
Article -
17
Optimization of job scheduling in a machine shop using genetic algorithm
Published 2002“…A modified version of GA known as string GA has been used to get the near optimal cycle time for permutation analysis. …”
Get full text
Get full text
Article -
18
New Sequential and Parallel Division Free Methods for Determinant of Matrices
Published 2013“…The research also aims to generalise the Sarrus Rule for any order of square matrices based on permutations which are derived using starter sets. Two strategies were introduced to generate distinct starter sets namely the circular and the exchanging of two elements operations. …”
Get full text
Get full text
Get full text
Thesis -
19
Dynamic key scheduling algorithm for block ciphers using quasigroup string transformation
Published 2018“…A method of generating isotope from a non-associative quasigroup using one permutation with full inheritance is achieved. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
20
Optimization of multi-holes drilling path using particle swarm optimization
Published 2022“…The algorithm was tested on 15 test problems where between 10 to 150 holes were randomly generated. …”
Get full text
Get full text
Thesis