191 search results - page 28 / 39 » A Comparison of Cartesian Genetic Programming and Linear Gen... |
EVOW
2005
Springer
15 years 3 months ago
2005
Springer
Reversible computing basically means computation with less or not at all electrical power. Since the standard binary gates are not usually reversible we use the Fredkin gate in ord...
CEC
2010
IEEE
14 years 1 months ago
2010
IEEE
— If a population of programs evolved not for a few hundred generations but for a few hundred thousand or more, could it generate more interesting behaviours and tackle more comp...
107
click to vote
SOFTCO
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. An artificial neural network with all its elements is a rather complex structure, not easily constructed and/or trained to perform a particular task. Consequently, severa...
CTCS
1989
Springer
15 years 1 months ago
1989
Springer
We introduce the notion of a candidate for “multiple valued universal constructions” and define stable functors (which generalise functors with left adjoints) in terms of fac...
EVOW
2007
Springer
15 years 3 months ago
2007
Springer
We present several practical improvements to the interactive evolution of 2D images, some of which are also applicable to more general genetic programming problems. We introduce tr...