<p>QUasi-Affine TRansformation Evolutionary (QUATRE) is an excellent algorithm that generalized differential evolution to matrix form. There are two approaches of Binary QUATRE (BQUATRE) convert the continuous search space binary one. The convergence process meta-heuristic algorithms can be regarded as stages: exploration and exploitation. Generally speaking, transfer function plays impor...

In multispectral color imaging, there is a demand to select a reduced number of optimal imaging channels to simultaneously speed up the image acquisition process and keep reflectance reconstruction accuracy. In this paper, the channel selection problem is cast as the binary optimization problem, and is consequently solved using a novel binary differential evolution (DE) algorithm. In the propos...

Multi-objective EAs (MOEAs) are well established population-based techniques for solving various search and optimization problems. MOEAs employ different evolutionary operators to evolve populations of solutions for approximating the set of optimal solutions of the problem at hand in a single simulation run. Different evolutionary operators suite different problems. The use of multiple operator...

The modification of message that meets the sufficient conditions for collision is found in the last step of differential attack proposed by Wang et all. (2005) on MD4 hash algorithm. Here we show how this attack phase, finding a collision starting from the list of sufficient conditions for the collision, can be implemented using a combination of two algorithms evolutionary algorithm and hill cl...

This paper deals with a method of the radiation pattern determination of the directional antennas. The method combining both the functional minimization method and the Fourier iterative algorithm is based on the phaseless near-field measurement on two plane surfaces. The method is used for a reconstruction of the phase distribution on the aperture of the measured antenna, and for the determinat...

This research presents the mining of quantitative association rules based on evolutionary computation techniques. First, a real-coded genetic algorithm that extends the well-known binary-coded CHC algorithm has been projected to determine the intervals that define the rules without needing to discretize the attributes. The proposed algorithm is evaluated in synthetic datasets under different le...

binary decision diagram (in short bdd) is an efficient data structure which has been used widely in computer science and engineering. bdd-based attack in key stream cryptanalysis is one of the best forms of attack in its category. in this paper, we propose a new key stream attack which is based on zdd(zero-suppressed bdd). we show how a zdd-based key stream attack is more efficient in time and ...

Constraint Satisfaction Problems form a class of problems that are generally computationally difficult and have been addressed with many complete and heuristic algorithms. We present two complete algorithms, as well as two evolutionary algorithms, and compare them on randomly generated instances of binary constraint satisfaction problems. We find that the evolutionary algorithms are less effect...