390 search results - page 3 / 78 » When is an estimation of distribution algorithm better than ... |
GECCO
2008
Springer
13 years 6 months ago
2008
Springer
In this paper we explore the model–building issue of multiobjective optimization estimation of distribution algorithms. We argue that model–building has some characteristics t...
SIGMOD
2005
ACM
14 years 5 months ago
2005
ACM
The problem of estimating progress for long-running queries has recently been introduced. We analyze the characteristics of the progress estimation problem, from the perspective o...
IJON
2006
13 years 5 months ago
2006
Ensembles of learning machines have been formally and empirically shown to outperform (generalise better than) single predictors in many cases. Evidence suggests that ensembles ge...
INFOSCALE
2006
ACM
13 years 11 months ago
2006
ACM
An open problem for Distributed Information Retrieval systems (DIR) is how to represent large document repositories, also known as resources, both accurately and efficiently. Obt...
GECCO
2010
Springer
13 years 7 months ago
2010
Springer
Estimation-of-distribution algorithm using Cauchy sampling distribution is compared with the bi-population CMA evolutionary strategy which was one of the best contenders in the bl...