1162 search results - page 150 / 233 » Cartesian genetic programming |
127
click to vote
DAGSTUHL
2006
15 years 3 months ago
2006
We consider the computational complexity of producing the best possible offspring in a crossover, given two solutions of the parents. The crossover operators are studied on the cla...
119
Voted
GECCO
2007
Springer
15 years 8 months ago
2007
Springer
Generating a random sampling of program trees with specified function and terminal sets is the initial step of many program evolution systems. I present a theoretical and experim...
138
click to vote
SAC
2006
ACM
15 years 2 months ago
2006
ACM
Many combinatorial optimization problems in biosequence analysis are solved via dynamic programming. To increase programming productivity and program reliability, a domain specifi...
146
click to vote
WOB
2004
15 years 3 months ago
2004
ABSTRACT. Reconfigurable systolic arrays can be adapted to efficiently resolve a wide spectrum of computational problems; parallelism is naturally explored in systolic arrays and r...
114
Voted
CEC
2010
IEEE
15 years 3 months ago
2010
IEEE
Abstract-- Reinforcement Programming (RP) is a new approach to automatically generating algorithms, that uses reinforcement learning techniques. This paper describes the RP approac...