422 search results - page 47 / 85 » Multithreaded SAT Solving |
85
Voted
ECAI
2008
Springer
15 years 19 days ago
2008
Springer
Abstract. Measuring relational similarity between words is important in numerous natural language processing tasks such as solving analogy questions and classifying noun-modifier r...
81
Voted
AMAI
2005
Springer
14 years 10 months ago
2005
Springer
Mediator systems integrate distributed, heterogeneous and autonomous data sources, but their e ective use requires the solution of hard query optimization problems. This is usuall...
98
Voted
LPAR
2005
Springer
15 years 4 months ago
2005
Springer
Local search algorithms are one of the effective methods for solving hard combinatorial problems. However, a serious problem of this approach is that the search often traps at loca...
DAC
2010
ACM
15 years 2 months ago
2010
ACM
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...
IJCAI
2007
15 years 9 days ago
2007
Local search procedures for solving satisfiability problems have attracted considerable attention since the development of GSAT in 1992. However, recent work indicates that for m...