75 search results - page 5 / 15 » On the Strength of Size Limits in Linear Genetic Programming |
ATAL
2006
Springer
13 years 10 months ago
2006
Springer
Developing scalable algorithms for solving partially observable Markov decision processes (POMDPs) is an important challenge. One promising approach is based on representing POMDP...
CEC
2010
IEEE
13 years 7 months ago
2010
IEEE
At the current state of the art, genetic programs do not contain two constructs that commonly occur in programs written by humans, that is, loops and functions with parameters. In ...
BMCBI
2010
13 years 6 months ago
2010
Background: Determining a suitable sample size is an important step in the planning of microarray experiments. Increasing the number of arrays gives more statistical power, but ad...
ASPDAC
2008
ACM
13 years 8 months ago
2008
ACM
- We present a topology synthesis method for high performance System-on-Chip (SoC) design. Our method provides an optimal topology of on-chip communication network for the given ba...
CEC
2011
IEEE
12 years 6 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...