Sciweavers

1157 search results - page 10 / 232
» Solving iterated functions using genetic programming
Sort
View
PPSN
1992
Springer
13 years 11 months ago
Nonstationary Function Optimization using the Structured Genetic Algorithm
In this paper, we describe the application of a new type of genetic algorithm called the Structured Genetic Algorithm (sGA) for function optimization in nonstationary environments...
Dipankar Dasgupta, Douglas R. McGregor
GECCO
2011
Springer
276views Optimization» more  GECCO 2011»
12 years 11 months ago
Evolution of reward functions for reinforcement learning
The reward functions that drive reinforcement learning systems are generally derived directly from the descriptions of the problems that the systems are being used to solve. In so...
Scott Niekum, Lee Spector, Andrew G. Barto
GECCO
2006
Springer
156views Optimization» more  GECCO 2006»
13 years 11 months ago
Improving GP classifier generalization using a cluster separation metric
Genetic Programming offers freedom in the definition of the cost function that is unparalleled among supervised learning algorithms. However, this freedom goes largely unexploited...
Ashley George, Malcolm I. Heywood
PRICAI
2004
Springer
14 years 22 days ago
Power of Brute-Force Search in Strongly-Typed Inductive Functional Programming Automation
Abstract. A successful case of applying brute-force search to functional programming automation is presented and compared with a conventional genetic programming method. From the i...
Susumu Katayama
ICGA
1997
126views Optimization» more  ICGA 1997»
13 years 8 months ago
Evolution of Graph-Like Programs with Parallel Distributed Genetic Programming
Parallel Distributed Genetic Programming (PDGP) is a new form of Genetic Programming (GP) suitable for the development of programs with a high degree of parallelism. Programs are ...
Riccardo Poli