Classes of problems in the black box scenario
Abstract
References
Index Terms
- Classes of problems in the black box scenario
Recommendations
Mitotic classes
COLT'07: Proceedings of the 20th annual conference on Learning theoryFor the natural notion of splitting classes into two disjoint subclasses via a recursive classifier working on texts, the question is addressed how these splittings can look in the case of learnable classes. Here the strength of the classes is compared ...
Lessons from the black-box: fast crossover-based genetic algorithms
GECCO '13: Proceedings of the 15th annual conference on Genetic and evolutionary computationThe recently active research area of black-box complexity revealed that for many optimization problems the best possible black-box optimization algorithm is significantly faster than all known evolutionary approaches. While it is not to be expected that ...
The no free lunch and realistic search algorithms
GECCO '06: Proceedings of the 8th annual conference on Genetic and evolutionary computationThe No-Free-Lunch theorems (NFLTs) are criticized for being too general to be of any relevance to the real world scenario. This paper investigates, both formally and empirically, the implications of the NFLTs for realistic search algorithms. In the ...
Comments
Information & Contributors
Information
Published In
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Article
Conference
Acceptance Rates
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 10Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in