158 search results - page 3 / 32 » On Complexity of Optimal Recombination for Binary Representa... |
ICASSP
2008
IEEE
14 years 2 months ago
2008
IEEE
We consider the problem of planar object registration on binary images where the aligning transformation is restricted to the group of affine transformations. Previous approaches...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
In this article, new variation operators for evolutionary multiobjective algorithms (EMOA) are proposed. On the basis of a predator-prey model theoretical considerations as well a...
ISMVL
1999
IEEE
13 years 12 months ago
1999
IEEE
We introduce a new implementation of a ternary adder with four inputs and two outputs. This ternary adder reduces the number of digits in a multiplication compared with a binary m...
GECCO
2007
Springer
13 years 11 months ago
2007
Springer
The traditional GA theory is pillared on the Building Block Hypothesis (BBH) which states that Genetic Algorithms (GAs) work by discovering, emphasizing and recombining low order ...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
In this paper, we introduce a new genetic representation -- a splicing/decomposable (S/D) binary encoding, which was proposed based on some theoretical guidance and existing recom...