Search Results - (( development permutation generation algorithm ) OR ( java simulation optimization algorithm ))
Search alternatives:
- development permutation »
- generation algorithm »
- java simulation »
-
1
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 -
2
Starter Set Generation Based on Factorial Numbers for Half Wing of Butterfly Representation
Published 2021“…Case is demonstrated for a new algorithm for lexicographic order permutation. In conclusion, this new development is only applicable for generating starter sets as a lexicographic order permutation due to factorial numbers is applicable for lexicographic order permutation…”
Get full text
Get full text
Get full text
Article -
3
Parallel strategy for starter sets to list all permutation based on cycling restriction
Published 2011“…permutations.The sequential algorithm is developed and parallelized for parallel computing by integrating with Message Passing Interface (MPI) libraries. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
4
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 -
5
-
6
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 -
7
Numerical assessment on makespan minimization by adopting NEH heuristics in permutation flow shop
Published 2015“…Few algorithms have been developed for deciding the sequence of n jobs and m machines to minimize makespan in the flow shop. …”
Get full text
Get full text
Conference or Workshop Item -
8
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 -
9
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 -
10
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 -
11
Modified Neh Heuristic On Makespan Reduction In Permutation Flow Shop Problems
Published 2015“…Throughout the past 30 years, the NEH heuristics developed by Nawaz, Enscore and Ham has been commonly regarded as the best heuristic for minimizing the makespan in permutation flow shops. …”
Get full text
Get full text
Thesis -
12
Attribute reduction based scheduling algorithm with enhanced hybrid genetic algorithm and particle swarm optimization for optimal device selection
Published 2022“…The simulation is implemented with iFogSim and java programming language. …”
Get full text
Get full text
Article -
13
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. …”
Get full text
Get full text
Get full text
Thesis -
14
Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing
Published 2011“…Global pheromone update is performed after the completion of processing the jobs in order to reduce the pheromone value of resources. A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against existing grid resource management algorithms such as Antz algorithm, Particle Swarm Optimization algorithm, Space Shared algorithm and Time Shared algorithm, in terms of processing time and resource utilization. …”
Get full text
Get full text
Get full text
Thesis -
15
Ant colony optimization algorithm for load balancing in grid computing
Published 2012“…The proposed algorithm is known as the enhance ant colony optimization (EACO). …”
Get full text
Get full text
Get full text
Monograph -
16
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 -
17
Dynamic key scheduling algorithm for block ciphers using quasigroup string transformation
Published 2018“…Based on the dynamic shapeless quasigroup and the proposed new string transformation, a Dynamic Key Scheduling Algorithm (DKSA) is developed. To validate the findings, non-associativity of the generated isotopes has been tested and the generated isotopes appeared to be non-associative. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
18
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. …”
Review -
19
Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization
Published 2019“…This study proposes a car parking management system which applies Dijkstra’s algorithm, Ant Colony Optimization (ACO) and Binary Search Tree (BST) in structuring a guidance system for indoor parking. …”
Get full text
Get full text
Thesis -
20
Features selection for intrusion detection system using hybridize PSO-SVM
Published 2016“…Hybridize Particle Swarm Optimization (PSO) as a searching algorithm and support vector machine (SVM) as a classifier had been implemented to cope with this problem. …”
Get full text
Get full text
Thesis