33 search results - page 5 / 7 » No free lunch: 1995-2008 |
188
Voted
ALGORITHMICA
2010
15 years 5 months ago
2010
255
click to vote
PAMI
2012
13 years 9 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...
191
click to vote
GECCO
2006
Springer
15 years 10 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 ...
174
Voted
AUSAI
2005
Springer
15 years 8 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...