Sciweavers

Share
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
10 years 1 months ago
On the runtime analysis of the 1-ANT ACO algorithm
The runtime analysis of randomized search heuristics is a growing field where, in the last two decades, many rigorous results have been obtained. These results, however, apply pa...
Benjamin Doerr, Frank Neumann, Dirk Sudholt, Carst...
GECCO
2007
Springer
158views Optimization» more  GECCO 2007»
10 years 1 months ago
Continuous lunches are free!
This paper investigates extensions of No Free Lunch (NFL) theorems to countably infinite and uncountable infinite domains. The original NFL due to Wolpert and Macready states th...
Anne Auger, Olivier Teytaud
ATAL
2007
Springer
10 years 1 months ago
Automatic feature extraction for autonomous general game playing agents
The General Game Playing (GGP) problem is concerned with developing systems capable of playing many different games, even games the system has never encountered before. Successful...
David M. Kaiser
books