16 search results - page 2 / 4 » The no free lunch and realistic search algorithms |
EMO
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. The classic NFL theorems are invariably cast in terms of single objective optimization problems. We confirm that the classic NFL theorem holds for general multiobjective ...
EVOW
2008
Springer
13 years 6 months ago
2008
Springer
We introduce the concept of "minimal" search algorithm for a set of functions to optimize. We investigate the structure of closed under permutation (c.u.p.) sets and we c...
GECCO
2008
Springer
13 years 6 months ago
2008
Springer
Proofs and empirical evidence are presented which show that a subset of algorithms can have identical performance over a subset of functions, even when the subset of functions is ...
SIGIR
2011
ACM
12 years 7 months ago
2011
ACM
This work explores the problem of cross-lingual pairwise similarity, where the task is to extract similar pairs of documents across two different languages. Solutions to this pro...
AUSAI
2005
Springer
13 years 6 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...