Sciweavers

Share
GECCO
2011
Springer
270views Optimization» more  GECCO 2011»
8 years 10 months ago
Geometric surrogate-based optimisation for permutation-based problems
In continuous optimisation, surrogate models (SMs) are used when tackling real-world problems whose candidate solutions are expensive to evaluate. In previous work, we showed that...
Alberto Moraglio, Yong-Hyuk Kim, Yourim Yoon
GECCO
2011
Springer
276views Optimization» more  GECCO 2011»
8 years 10 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
2011
Springer
248views Optimization» more  GECCO 2011»
8 years 10 months ago
Size-based tournaments for node selection
In genetic programming, the reproductive operators of crossover and mutation both require the selection of nodes from the reproducing individuals. Both unbiased random selection a...
Thomas Helmuth, Lee Spector, Brian Martin
GECCO
2011
Springer
240views Optimization» more  GECCO 2011»
8 years 10 months ago
Collisions are helpful for computing unique input-output sequences
Computing unique input-output sequences (UIOs) from finite state machines (FSMs) is important for conformance testing in software engineering, where evolutionary algorithms (EAs)...
Chao Qian, Yang Yu, Zhi-Hua Zhou
GECCO
2011
Springer
247views Optimization» more  GECCO 2011»
8 years 10 months ago
An agent-based model of the effects of a primate social structure on the speed of natural selection
The rate of speciation is in most mammals an order of magnitude faster than in most other vertebrates. It is faster still in the social mammals. The apparent association between c...
Gideon M. Gluckman, Joanna Bryson
GECCO
2011
Springer
274views Optimization» more  GECCO 2011»
8 years 10 months ago
Fuzzy dynamical genetic programming in XCSF
—A number of representation schemes have been presented for use within Learning Classifier Systems, ranging from binary encodings to Neural Networks, and more recently Dynamical ...
Richard Preen, Larry Bull
GECCO
2011
Springer
236views Optimization» more  GECCO 2011»
8 years 10 months ago
Online, GA based mixture of experts: a probabilistic model of ucs
In recent years there have been efforts to develop a probabilistic framework to explain the workings of a Learning Classifier System. This direction of research has met with lim...
Narayanan Unny Edakunni, Gavin Brown, Tim Kovacs
GECCO
2011
Springer
232views Optimization» more  GECCO 2011»
8 years 10 months ago
Mutation rates of the (1+1)-EA on pseudo-boolean functions of bounded epistasis
When the epistasis of the fitness function is bounded by a constant, we show that the expected fitness of an offspring of the (1+1)-EA can be efficiently computed for any point...
Andrew M. Sutton, Darrell Whitley, Adele E. Howe
GECCO
2011
Springer
346views Optimization» more  GECCO 2011»
8 years 10 months ago
Evolving relationships between social networks and stakeholder involvement in software projects
Software projects often fail because stakeholder communication and involvement are inadequate. This paper proposes a novel method to understand project social networks and their c...
Soo Ling Lim, Peter J. Bentley
GECCO
2011
Springer
261views Optimization» more  GECCO 2011»
8 years 10 months ago
Spacing memetic algorithms
We introduce the Spacing Memetic Algorithm (SMA), a formal evolutionary model devoted to a systematic control of spacing (distances) among individuals. SMA uses search space dista...
Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz
books