Sciweavers

1129 search results - page 83 / 226
» Genetic Programming
Sort
View
GECCO
2008
Springer
130views Optimization» more  GECCO 2008»
15 years 5 months ago
Parsimony pressure made easy
The parsimony pressure method is perhaps the simplest and most frequently used method to control bloat in genetic programming. In this paper we first reconsider the size evolutio...
Riccardo Poli, Nicholas Freitag McPhee
PPSN
1994
Springer
15 years 8 months ago
Genetic L-System Programming
We present the Genetic L-System Programming (GLP) paradigm for evolutionary creation and development of parallel rewrite systems (Lsystems, Lindenmayer-systems) which provide a com...
Christian Jacob
CEC
2007
IEEE
15 years 8 months ago
Mining association rules from databases with continuous attributes using genetic network programming
Most association rule mining algorithms make use of discretization algorithms for handling continuous attributes. Discretization is a process of transforming a continuous attribute...
Karla Taboada, Eloy Gonzales, Kaoru Shimada, Shing...
EUROGP
2006
Springer
112views Optimization» more  EUROGP 2006»
15 years 8 months ago
The Halting Probability in Von Neumann Architectures
Abstract. Theoretical models of Turing complete linear genetic programming (GP) programs suggest the fraction of halting programs is vanishingly small. Convergence results proved f...
William B. Langdon, Riccardo Poli
GECCO
2006
Springer
161views Optimization» more  GECCO 2006»
15 years 8 months ago
Instance similarity and the effectiveness of case injection in a genetic algorithm for binary quadratic programming
When an evolutionary algorithm addresses a sequence of instances of the same problem, it can seed its population with solutions that it found for previous instances. This techniqu...
Jason Amunrud, Bryant A. Julstrom