401 search results - page 9 / 81 » Genetic Programming Theory and Practice |
EC
1998
13 years 7 months ago
1998
L. M. Adleman launched the field of DNA computing with a demonstration in 1994 that strands of DNA could be used to solve the Hamiltonian path problem for a simple graph. He also...
GECCO
2009
Springer
13 years 5 months ago
2009
Springer
An iterated function f(x) is a function that when composed with itself, produces a given expression f(f(x))=g(x). Iterated functions are essential constructs in fractal theory and...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
When Genetic Programming is used to evolve arithmetic functions it often operates by composing them from a fixed collection of elementary operators and applying them to parameters...
GECCO
1999
Springer
13 years 11 months ago
1999
Springer
This paper examines some of the reporting and research practices concerning empirical work in genetic programming. We describe several common loopholes and offer three case studie...
KBSE
1997
IEEE
13 years 11 months ago
1997
IEEE
Proofs in the Nuprl system, an implementation of a constructive type theory, yield “correct-by-construction” programs. In this paper a new methodology is presented for extract...