25 search results - page 1 / 5 » Representation and structural biases in CGP |
CEC
2009
IEEE
13 years 11 months ago
2009
IEEE
— An evolutionary algorithm automatically discovers suitable solutions to a problem, which may lie anywhere in a large search space of candidate solutions. In the case of Genetic...
GECCO
2005
Springer
13 years 10 months ago
2005
Springer
This research presents an analysis of the reported successes of the Cartesian Genetic Programming method on a simplified form of the Boolean parity problem. We show the method of...
CORR
2010
Springer
13 years 1 months ago
2010
Springer
To find the best lattice model representation of a given full atom protein structure is a hard computational problem. Several greedy methods have been suggested where results are ...
IEAAIE
2005
Springer
13 years 10 months ago
2005
Springer
When using a constructive search algorithm, solutions to scheduling problems such as the job shop and open shop scheduling problems are typically represented as permutations of the...
ML
1998
ACM
13 years 4 months ago
1998
ACM
It is well known that prior knowledge or bias can speed up learning, at least in theory. It has proved di cult to make constructive use of prior knowledge, so that approximately c...