Sciweavers

2 search results - page 1 / 1
» Probing for limits to building block mixing with a tunably-d...
Sort
View
GECCO
2005
Springer
13 years 10 months ago
Probing for limits to building block mixing with a tunably-difficult problem for genetic programming
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 ...
Jason M. Daida, Michael E. Samples, Matthew J. Byo...
CEC
2011
IEEE
12 years 5 months ago
Cost-benefit analysis of using heuristics in ACGP
—Constrained Genetic Programming (CGP) is a method of searching the Genetic Programming search space non-uniformly, giving preferences to certain subspaces according to some heur...
John W. Aleshunas, Cezary Z. Janikow