Search Results - (( based permutation based algorithm ) OR ( evolution optimization path algorithm ))
Search alternatives:
- evolution optimization »
- based permutation »
- permutation based »
- optimization path »
- path algorithm »
-
1
The Development Of A Robust Algorithm For Uav Path Planning In 3d Environment
Published 2016“…Significant research has been conducted on Unmanned Aerial Vehicle (UAV) path planning using evolutionary algorithms, such as Particle Swarm Optimization (PSO), Genetic Algorithm (GA), Differential Evolution (DE), and Biogeographic-Based Optimization (BBO). …”
Get full text
Get full text
Thesis -
2
JPEG Image Encryption Using Combined Reversed And Normal Direction-Distorted Dc Permutation With Key Scheduling Algorithm-Based Permutation
Published 2008“…The proposed approach uses a frequency domain combinational framework of coefficients scrambling with Key Scheduling Algorithm based (KSA-based) permutation. This novel algorithm applies coefficients scrambling using Combined-Reverse-and-Normal-Direction (CRND) scanning together with Distorted DC permutation (DDP). …”
Get full text
Get full text
Thesis -
3
Development of an improved GWO algorithm for solving optimal paths in complex vertical farms with multi-robot multi-tasking
Published 2024“…The EPDE-GWO algorithm is compared with Genetic Algorithm (GA), Simulated Annealing (SA), Dung Beetle Optimizer (DBO), and Particle Swarm Optimization (PSO). …”
Get full text
Get full text
Get full text
Article -
4
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. Previously starter sets are generated by using their permutation under exchange-based and cycling based. …”
Get full text
Get full text
Get full text
Article -
5
SEALiP: A simple and efficient algorithm for listing permutation via starter set method
Published 2013“…In order to demonstrate the algorithm, we are keen to list the permutations with the special references for cases of three and four objects.Based on this algorithm, a new method for listing permutations is developed and analyzed.This new permutation method will be compared with the existing lexicographic method.The results revealed that this new method is more efficient in terms of computation time.…”
Get full text
Get full text
Get full text
Article -
6
New algorithm for listing all permutations
Published 2010“…The most challenging task dealing with permutation is when the element is large. In this paper, a new algorithm for listing down all permutations for n elements is developed based on distinct starter sets. …”
Get full text
Get full text
Get full text
Article -
7
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 -
8
-
9
A permutation parallel algorithm under exchange restriction with message passing interface
Published 2014“…Permutations. However permutation generation is time consuming process, the implementation of sequential algorithm to parallel computation is the option for reducing the computation time. …”
Get full text
Get full text
Conference or Workshop Item -
10
Finding minimum path by using Genetic Algorithm (GA)/ Siti Zuraifah Hashim
Published 2007“…Roadways and telephone systems are the examples of them. Genetic Algorithms (GA), pioneered by John Holland, applies the principle of evolution found in nature to the problem of finding an optimal solution. …”
Get full text
Get full text
Thesis -
11
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 -
12
Improved Watermarking Algorithm Based on Discrete Wavelet Transform and Fibonacci Permutation
Published 2005“…This algorithm is based on the combination of Fibonacci permutation and discrete wavelet transforms (DWT). …”
Get full text
Get full text
Thesis -
13
Differential evolution optimization for constrained routing in Wireless Mesh Networks
Published 2014“…This solution addresses efficient and optimal routing path construction for cost and quality metrics of the application. …”
Get full text
Get full text
Get full text
Proceeding Paper -
14
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 -
15
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 -
16
-
17
Permutation entropy based full-reference image quality qssessment
Published 2019“…Motivated by the need of appropriate objective models, we propose a novel objective IQA algorithm, namely, Permutation Entropy Deviation Index (PEDI), based on the working principle of permutation entropy (PE). …”
Get full text
Get full text
Conference or Workshop Item -
18
A cylindrical coordinate system with dynamic permutation table for blowfish algorithm
Published 2014“…The Blowfish Algorithm (BA) is a symmetric block cipher that iterates simple encryption and decryption functions by using Feistel networks.BA keys vary from 32-448 bits to ensure a high level of security.However, the BA requires a high memory percentage and it has a problem regarding randomness of output with text and image files having large strings of identical bytes.One solution to the seissues is to design a new Cryptography algorithm based on the BA that incorporates an F-function into a Cylindrical Coordinate System (CCS).The resulting F-function is known as a CCS with a Dynamic Permutation Table (DPT) or CCSDPT whereas the new algorithm is called the New BA (NBA).The objectives of the CCSDPT are to reduce memory requirements, enhance the randomness of the output and increase resistance to attacks through byte relocation and transformation in the right cylinder.NBA is evaluated by investigates the output of the algorithm by using statistical tests from the National Institute of Standard and Technology (NIST) with five types of data and compared with the BA.The findings of the NIST tests show that the NBA is suitable for any data stream, even those with long strings of identical bytes. …”
Get full text
Get full text
Get full text
Article -
19
Key schedule algorithm based on coordinate geometry of a three-dimensional hybrid cube
Published 2019“…This research proposed a new Key Schedule Algorithm based on the coordinate geometry of a Hybrid Cube (KSAHC) for the non-binary block cipher. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
20