Note on generalization in experimental algorithmics.
A recurring theme in mathematical software evaluation is the generalization of rankings of algorithms on test problems to build knowledge-based recommender systems for algorithm selection. A key issue is to profile algorithms in terms of the qualitative characteristics of benchmark problems. In this...
| Pubblicato in: | ACM transactions on mathematical software. 26, 4 (2000). |
|---|---|
| Autore principale: | |
| Altri autori: | |
| Natura: | Articolo |
| Lingua: | English |
| Soggetti: |