Sciweavers

22 search results - page 4 / 5
» GP Echo Subsumption = Improved Problem Solving
Sort
View
GECCO
2007
Springer
171views Optimization» more  GECCO 2007»
13 years 11 months ago
Toward a better understanding of rule initialisation and deletion
A number of heuristics have been used in Learning Classifier Systems to initialise parameters of new rules, to adjust fitness of parent rules when they generate offspring, and ...
Tim Kovacs, Larry Bull
EUROGP
2007
Springer
135views Optimization» more  EUROGP 2007»
13 years 11 months ago
A Grammatical Genetic Programming Approach to Modularity in Genetic Algorithms
The ability of Genetic Programming to scale to problems of increasing difficulty operates on the premise that it is possible to capture regularities that exist in a problem environ...
Erik Hemberg, Conor Gilligan, Michael O'Neill, Ant...
GECCO
2011
Springer
276views Optimization» more  GECCO 2011»
12 years 9 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
2004
Springer
118views Optimization» more  GECCO 2004»
13 years 11 months ago
Adapting Representation in Genetic Programming
Genetic Programming uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees....
Cezary Z. Janikow
PPOPP
2010
ACM
14 years 2 months ago
Scalable communication protocols for dynamic sparse data exchange
Many large-scale parallel programs follow a bulk synchronous parallel (BSP) structure with distinct computation and communication phases. Although the communication phase in such ...
Torsten Hoefler, Christian Siebert, Andrew Lumsdai...