A probabilistic architecture for algorithm portfolios
Heuristic algorithms for logical reasoning are increasingly successful on computationally difficult problems such as satisfiability, and these solvers enable applications from circuit verification to software synthesis. Whether a problem instance can be solved, however, often depends in practice on...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | en_US |
| Published: |
2013
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/2152/19828 |