33 search results - page 5 / 7 » No free lunch: 1995-2008 |
NECO
2007
14 years 9 months ago
2007
90
Voted
ALGORITHMICA
2010
14 years 7 months ago
2010
127
click to vote
PAMI
2012
12 years 12 months ago
2012
Abstract—We consider two desired properties of learning algorithms: sparsity and algorithmic stability. Both properties are believed to lead to good generalization ability. We sh...
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
Metaheuristics have often been shown to be effective for difficult combinatorial optimization problems. The reason for that, however, remains unclear. A framework for a theory of ...
AUSAI
2005
Springer
14 years 11 months ago
2005
Springer
Abstract. Methods of adaptive constraint satisfaction have recently become of interest to overcome the limitations imposed on “black-box” search algorithms by the no free lunch...