Sciweavers

1162 search results - page 115 / 233
» Cartesian genetic programming
Sort
View
GECCO
2008
Springer
130views Optimization» more  GECCO 2008»
13 years 10 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
LREC
2010
216views Education» more  LREC 2010»
13 years 10 months ago
Automatic Grammar Rule Extraction and Ranking for Definitions
Learning texts contain much implicit knowledge which is ideally presented to the learner in a structured manner - a typical example being definitions of terms in the text, which w...
Claudia Borg, Mike Rosner, Gordon J. Pace
CPHYSICS
2006
204views more  CPHYSICS 2006»
13 years 9 months ago
Genetically controlled random search: a global optimization method for continuous multidimensional functions
A new stochastic method for locating the global minimum of a multidimensional function inside a rectangular hyperbox is presented. A sampling technique is employed that makes use ...
Ioannis G. Tsoulos, Isaac E. Lagaris
EUROGP
2006
Springer
112views Optimization» more  EUROGP 2006»
14 years 19 days 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
ECOOP
2001
Springer
14 years 1 months ago
Precise Constraint-Based Type Inference for Java
Abstract. Precise type information is invaluable for analysis and optimization of object-oriented programs. Some forms of polymorphism found in object-oriented languages pose signi...
Tiejun Wang, Scott F. Smith