#### Filter Results:

- Full text PDF available (5)

#### Publication Year

2010

2012

- This year (0)
- Last 5 years (2)
- Last 10 years (5)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

#### Key Phrases

Learn More

- Bryan Silverthorn, Risto Miikkulainen
- AAAI
- 2010

Different solvers for computationally difficult problems such as satisfiability (SAT) perform best on different instances. Algorithm portfolios exploit this phenomenon by predicting solvers’ performance on specific problem instances, then shifting computational resources to the solvers that appear best suited. This paper develops a new approach to the… (More)

Answer set programming (ASP) is a declarative programming formalism that allows a practitioner to specify a problem without describing an algorithm for solving it. In ASP, the tools for processing problem specifications are called answer set solvers. Because specified problems are often NP complete, these systems often require significant computational… (More)

vi

Introduction Algorithm portfolio methods (Huberman, Lukose, and Hogg 1997) use information about solvers and problem instances to allocate computational resources among multiple solvers, attempting to maximize the time spent on those well suited to each instance. Portfolio methods such as SATzilla (Xu et al. 2008) have proved increasingly effective in… (More)

- Bryan Silverthorn, Risto Miikkulainen
- SAT
- 2011

Few instances of a computational problem are sui generis; most instead belong to some distribution of related instances, and information gained from solving past instances from the distribution may be leveraged to solve future instances more efficiently. Algorithm portfolio methods and algorithm synthesis systems are two examples of this idea. This paper… (More)

- ‹
- 1
- ›