113 search results - page 11 / 23 » Design and Usage of a New Benchmark Problem for Genetic Prog... |
GECCO
2009
Springer
14 years 15 days ago
2009
Springer
New portable consumer embedded devices must execute multimedia applications (e.g., 3D games, video players and signal processing software, etc.) that demand extensive memory acces...
CGO
2011
IEEE
12 years 11 months ago
2011
IEEE
—Approximating ideal program outputs is a common technique for solving computationally difficult problems, for adhering to processing or timing constraints, and for performance ...
GPEM
2002
13 years 7 months ago
2002
In this paper we use genetic programming for changing the representation of the input data for machine learners. In particular, the topic of interest here is feature construction i...
TEC
2008
13 years 7 months ago
2008
Recent research on compact genetic algorithms (cGAs) has proposed a number of evolutionary search methods with reduced memory requirements. In cGAs, the evolution of populations is...
CEC
2011
IEEE
12 years 7 months ago
2011
IEEE
—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...