An Indirect Block-Oriented Representation for Genetic Programming
EuroGP '01 Proceedings of the 4th European Conference on Genetic Programming
Generating novel tactics through evolutionary computation
ACM SIGART Bulletin
Multi-sensor fusion: an Evolutionary algorithm approach
Information Fusion
Parameter Mapping: A genetic programming approach to function optimization
International Journal of Knowledge-based and Intelligent Engineering Systems - Genetic Programming An Emerging Engineering Tool
Community adaptive educational games
ICWL'10 Proceedings of the 2010 international conference on New horizons in web-based learning
Unearthing a Fossil from the History of Evolutionary Computation
Fundamenta Informaticae
Multi-objective evolutionary design of robust controllers on the grid
Engineering Applications of Artificial Intelligence
| Hi-index | 0.00 |
Consideration is given to the effects of representations and operators in evolutionary algorithms. In particular, theorems are presented which establish, under some general assumptions, that no choice of cardinality of a representation offers any intrinsic advantage over another. Functionally equivalent algorithms can be constructed regardless of the chosen representation. Further, a similar effective equivalence of variation operators is shown such that no intrinsic advantage accrues to any particular one-parent operator or any particular two-parent operator