844 search results - page 77 / 169 » Generalized crowding for genetic algorithms |
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
Both genetic algorithms (GAs) and temporal difference (TD) methods have proven effective at solving reinforcement learning (RL) problems. However, since few rigorous empirical com...
111
click to vote
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
This paper presents a comprehensive, multivariate account of how initial population material is used over the course of a genetic programming run as while various factors influenc...
GECCO
2005
Springer
2005
Springer
Probing for limits to building block mixing with a tunably-difficult problem for genetic programming
15 years 3 months ago
This paper describes a tunably-difficult problem for genetic programming (GP) that probes for limits to building block mixing and assembly. The existence of such a problem can be ...
ICMLA
2008
14 years 11 months ago
2008
In this work, a new learning paradigm called target selection is proposed, which can be used to test for associations between a single genetic variable and a multidimensional, qua...
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
We present a molecular computing algorithm for evolving DNA-encoded genetic programs in a test tube. The use of synthetic DNA molecules combined with biochemical techniques for va...