Automated configuration of algorithms for solving hard computational problems
The best-performing algorithms for many hard problems are highly parameterized. Selecting the best heuristics and tuning their parameters for optimal overall performance is often a difficult, tedious, and unsatisfying task. This thesis studies the automation of this important part of algorithm desig...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | English |
| Published: |
University of British Columbia
2009
|
| Online Access: | http://hdl.handle.net/2429/13907 |