Sciweavers

ECAI
2000
Springer
14 years 4 months ago
Focusing Search by Using Problem Solving Experience
Case-based reasoning (CBR) aims at using experience from the past in order to guide future problem solving rather than “starting from scratch” every time. We propose a CBR stra...
Eyke Hüllermeier
CG
2000
Springer
14 years 4 months ago
Lambda-Search in Game Trees - with Application to Go
This paper proposes a new method for searching two-valued (binary) game trees in games like chess or Go. Lambda-search uses null-moves together with different orders of threat-sequ...
Thomas Thomsen
FGR
2000
IEEE
141views Biometrics» more  FGR 2000»
14 years 4 months ago
Multiple Cues used in Model-Based Human Motion Capture
Human motion capture has lately been the object of much attention due to commercial interests. A ”touch free” computer vision solution to the problem is desirable to avoid the...
Thomas B. Moeslund, Erik Granum
PPDP
2001
Springer
14 years 4 months ago
When Do Bounds and Domain Propagation Lead to the Same Search Space?
This paper explores the question of when two propagationbased constraint systems have the same behaviour, in terms of search space. We categorise the behaviour of domain and bound...
Christian Schulte, Peter J. Stuckey
GECCO
2009
Springer
142views Optimization» more  GECCO 2009»
14 years 5 months ago
Benchmarking the (1+1)-CMA-ES on the BBOB-2009 noisy testbed
We benchmark an independent-restart-(1+1)-CMA-ES on the BBOB-2009 noisy testbed. The (1+1)-CMA-ES is an adaptive stochastic algorithm for the optimization of objective functions d...
Anne Auger, Nikolaus Hansen
GECCO
2009
Springer
147views Optimization» more  GECCO 2009»
14 years 5 months ago
Benchmarking the (1+1)-CMA-ES on the BBOB-2009 function testbed
The (1+1)-CMA-ES is an adaptive stochastic algorithm for the optimization of objective functions defined on a continuous search space in a black-box scenario. In this paper, an i...
Anne Auger, Nikolaus Hansen
GECCO
2009
Springer
135views Optimization» more  GECCO 2009»
14 years 5 months ago
Benchmarking the (1+1)-ES with one-fifth success rule on the BBOB-2009 noisy testbed
The (1+1)-ES with one-fifth success rule is one of the first and simplest stochastic algorithm proposed for optimization on a continuous search space in a black-box scenario. In...
Anne Auger
EMO
2009
Springer
140views Optimization» more  EMO 2009»
14 years 5 months ago
On Using Populations of Sets in Multiobjective Optimization
Abstract. Most existing evolutionary approaches to multiobjective optimization aim at finding an appropriate set of compromise solutions, ideally a subset of the Pareto-optimal se...
Johannes Bader, Dimo Brockhoff, Samuel Welten, Eck...
ICALP
2003
Springer
14 years 5 months ago
Analysis of a Simple Evolutionary Algorithm for Minimization in Euclidean Spaces
Although evolutionary algorithms (EAs) are widely used in practical optimization, their theoretical analysis is still in its infancy. Up to now results on the (expected) runtime ar...
Jens Jägersküpper
GECCO
2003
Springer
108views Optimization» more  GECCO 2003»
14 years 5 months ago
Implicit Parallelism
This paper assumes a search space of fixed-length strings, where the size of the alphabet can vary from position to position. Structural crossover is mask-based crossover, and thu...
Alden H. Wright, Michael D. Vose, Jonathan E. Rowe