74 search results - page 2 / 15 » Efficiently evolving programs through the search for novelty |
GECCO
2003
Springer
13 years 9 months ago
2003
Springer
Many evolutionary computation search spaces require fitness assessment through the sampling of and generalization over a large set of possible cases as input. Such spaces seem par...
GECCO
1999
Springer
13 years 8 months ago
1999
Springer
Top-down or analytical provers based on the connection tableau calculus are rather powerful, yet have notable shortcomings regarding redundancy control. A well-known and successfu...
SIGMOD
2009
ACM
14 years 4 months ago
2009
ACM
Most information extraction (IE) approaches have considered only static text corpora, over which we apply IE only once. Many real-world text corpora however are dynamic. They evol...
CEC
2009
IEEE
13 years 11 months ago
2009
IEEE
— In this paper, we use Genetic Programming (GP) to define a set of transforms on the space of greyscale images. The motivation is to allow an evolutionary algorithm means of tr...
TIT
2008
13 years 4 months ago
2008
Abstract--In linear programming (LP) decoding of a low-density parity-check (LDPC) code one minimizes a linear functional, with coefficients related to log-likelihood ratios, over ...