Search Results - (( java application optimization algorithm ) OR ( all permutation generation algorithm ))
Search alternatives:
- application optimization »
- generation algorithm »
- java application »
- all permutation »
-
1
A permutation parallel algorithm under exchange restriction with message passing interface
Published 2014“…The permutation generation method is based on starter sets generation under exchange operation and exploited it for listing down all n! …”
Get full text
Get full text
Conference or Workshop Item -
2
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 -
3
SEALiP: A simple and efficient algorithm for listing permutation via starter set method
Published 2013“…Algorithm for listing permutations for n elements is an arduous task.This paper attempts to introduce a novel method for generating permutations.The fundamental concept for this method is to seek a starter set to begin with as an initial set to generate all distinct permutations. …”
Get full text
Get full text
Get full text
Article -
4
New recursive circular algorithm for listing all permutations
Published 2014Get full text
Get full text
Get full text
Article -
5
New recursive circular algorithm for listing all permutations
Published 2014Get full text
Get full text
Get full text
Article -
6
Parallel strategy for starter sets to list all permutation based on cycling restriction
Published 2011“…This paper presents a parallel implementation of a new permutation generation method.This permutation generation method is based on the starter sets for listing all the n! …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
7
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 -
8
-
9
Numerical assessment on makespan minimization by adopting NEH heuristics in permutation flow shop
Published 2015“…Permutation flow shop problem (PFSP) is one of the important subclass of scheduling, where the order in each process remains unchanged for all machines. …”
Get full text
Get full text
Conference or Workshop Item -
10
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 -
11
A new starter sets generation method by fixing any element under exchange restriction
Published 2016“…Permutation array are of recent interest because of their application to data transmission over power lines.A new permutation technique based on distinct starter sets by employing circular and reversing operations.The crucial task is to generate the distinct starter sets by eliminating the equivalence starter sets.Meanwhile a new strategy for starter sets generation without generating its equivalence starter sets were developed and more efficient in terms of computation time compared to old method. …”
Get full text
Get full text
Article -
12
Modified Neh Heuristic On Makespan Reduction In Permutation Flow Shop Problems
Published 2015“…The order sequence for each process remains unchanged for all machines. Few algorithms have been developed to decide the sequence of n jobs and m machines that can minimize makespan in flow shops. …”
Get full text
Get full text
Thesis -
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
Optimization of blood vessel detection in retina images using multithreading and native code for portable devices
Published 2013Get full text
Get full text
Conference or Workshop Item -
15
Performance evaluation of real-time multiprocessor scheduling algorithms
Published 2016“…These results suggests that optimal algorithms may turn to be non-optimal when practically implemented, unlike USG which reveals far less scheduling overhead and hence could be practically implemented in real-world applications. …”
Get full text
Get full text
Conference or Workshop Item -
16
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 -
17
Dynamic key scheduling algorithm for block ciphers using quasigroup string transformation
Published 2018“…Key scheduling algorithm (KSA) is the mechanism that generates and schedules all sub-keys for each round of encryption. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
18
-
19
A new method for starter sets generation by fixing any element
Published 2015“…a new permutation technique based on distinct starter sets was introduced by employing circular and reversing operations.The crucial task is to generate the distinct starter sets by eliminating the equivalence starter sets.Meanwhile new strategies for starter sets generation without generating its equivalence starter sets were developed and more efficient in terms of computation time compared to old method.However all these algorithms have limitations in terms of fixing element to construct the first set (starter set) to begin with.It would be interesting to derive new strategy by fixing an element in any position. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
20
Attribute reduction based scheduling algorithm with enhanced hybrid genetic algorithm and particle swarm optimization for optimal device selection
Published 2022“…Enhance hybrid genetic algorithm and particle Swarm optimization are developed to select the optimal device in either fog or cloud. …”
Get full text
Get full text
Article