Sciweavers

1130 search results - page 2 / 226
» Bandit-Based Genetic Programming
Sort
View
GPEM
2000
121views more  GPEM 2000»
13 years 5 months ago
Bayesian Methods for Efficient Genetic Programming
ct. A Bayesian framework for genetic programming GP is presented. This is motivated by the observation that genetic programming iteratively searches populations of fitter programs ...
Byoung-Tak Zhang
GPEM
2002
109views more  GPEM 2002»
13 years 5 months ago
Some Considerations on the Reason for Bloat
A representation-less model for genetic programming is presented. The model is intended to examine the mechanisms that lead to bloat in genetic programming (GP). We discuss two hyp...
Wolfgang Banzhaf, William B. Langdon
GPEM
2002
134views more  GPEM 2002»
13 years 5 months ago
Genetic Programming and Autoconstructive Evolution with the Push Programming Language
Push is a programming language designed for the expression of evolving programs within an evolutionary computation system. This article describes Push and illustrates some of the o...
Lee Spector, Alan J. Robinson
FOGA
2011
12 years 9 months ago
Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics
Analyzing the computational complexity of evolutionary algorithms (EAs) for binary search spaces has significantly informed our understanding of EAs in general. With this paper, ...
Greg Durrett, Frank Neumann, Una-May O'Reilly
GPEM
2010
180views more  GPEM 2010»
13 years 4 months ago
Developments in Cartesian Genetic Programming: self-modifying CGP
Abstract Self-Modifying Cartesian Genetic Programming (SMCGP) is a general purpose, graph-based, developmental form of Genetic Programming founded on Cartesian Genetic Programming....
Simon Harding, Julian F. Miller, Wolfgang Banzhaf