Boosting as a Metaphor for Algorithm Design
- 1 January 2003
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 899-903
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Learning the Empirical Hardness of Optimization Problems: The Case of Combinatorial AuctionsLecture Notes in Computer Science, 2002
- A Bayesian Approach to Tackling Hard Computational Problems (Preliminary Report)Electronic Notes in Discrete Mathematics, 2001
- The Algorithm Selection Problem1976