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: | Silverthorn, Bryan Connor |
---|---|
Format: | Others |
Language: | en_US |
Published: |
2013
|
Subjects: | |
Online Access: | http://hdl.handle.net/2152/19828 |
Similar Items
-
INVESTMENT PORTFOLIO OPTIMIZATION BY APPLYING A GENETIC ALGORITHM-BASED APPROACH
by: Petras Dubinskas, et al.
Published: (2017-11-01) -
Genetic Programming and Genetic Algorithms for Propositions
by: Nabil M. HEWAHI
Published: (2012-01-01) -
Algorithm portfolio based scheme for dynamic optimization problems
by: Jenny Fajardo Calderín, et al.
Published: (2015-08-01) -
Solving MAXSAT by Decoupling Optimization and Satisfaction
by: Davies, Jessica
Published: (2013) -
Solving MAXSAT by Decoupling Optimization and Satisfaction
by: Davies, Jessica
Published: (2013)