Sciweavers

1930 search results - page 6 / 386
» Learning to Solve QBF
Sort
View
SEAL
2010
Springer
13 years 5 months ago
A Parallel Algorithm for Solving Large Convex Minimax Problems
Ramnik Arora, Utkarsh Upadhyay, Rupesh Tulshyan, J...
ICML
2000
IEEE
14 years 8 months ago
Solving the Multiple-Instance Problem: A Lazy Learning Approach
As opposed to traditional supervised learning, multiple-instance learning concerns the problem of classifying a bag of instances, given bags that are labeled by a teacher as being...
Jun Wang, Jean-Daniel Zucker
ECAI
2010
Springer
13 years 8 months ago
Learning When to Use Lazy Learning in Constraint Solving
Abstract. Learning in the context of constraint solving is a technique by which previously unknown constraints are uncovered during search and used to speed up subsequent search. R...
Ian P. Gent, Christopher Jefferson, Lars Kotthoff,...
DAC
2010
ACM
13 years 11 months ago
An AIG-Based QBF-solver using SAT for preprocessing
In this paper we present a solver for Quantified Boolean Formulas (QBFs) which is based on And-Inverter Graphs (AIGs). We use a new quantifier elimination method for AIGs, which...
Florian Pigorsch, Christoph Scholl