3 search results - page 1 / 1 » No free lunch, Kolmogorov complexity and the information lan... |
CEC
2005
IEEE
14 years 1 months ago
2005
IEEE
GECCO
2006
Springer
13 years 11 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 ...
DCC
2006
IEEE
14 years 7 months ago
2006
IEEE
The use of compression algorithms in machine learning tasks such as clustering and classification has appeared in a variety of fields, sometimes with the promise of reducing probl...