Online Dynamic Algorithm Portfolios: Minimizing the computational cost of problem solving
This thesis presents methods for minimizing the computational effort of problem solving. Rather than looking at a particular algorithm, we consider the issue of computational complexity at a higher level, and propose techniques that, given a set of candidate algorithms, of unknown performance, learn...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Doctoral Thesis |
| Language: | en |
| Published: |
Università della Svizzera italiana, Lugano, Switzerland
2010
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/250787 |