101 search results - page 6 / 21 » Understanding the Power of Clause Learning |
ESANN
2004
13 years 9 months ago
2004
This work is designed to contribute to a deeper understanding of the recently proposed Merging SOM (MSOM). Its context model aims at the representation of sequences, an important s...
AAAI
2007
13 years 10 months ago
2007
Local search is widely applied to satisfiable SAT problems, and on some problem classes outperforms backtrack search. An intriguing challenge posed by Selman, Kautz and McAlleste...
LPAR
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. In this paper we study the problem of solving hard propositional satisfiability problem (SAT) instances in a computing grid or cloud, where run times and communication b...
ALT
2011
Springer
12 years 7 months ago
2011
Springer
Deep architectures are families of functions corresponding to deep circuits. Deep Learning algorithms are based on parametrizing such circuits and tuning their parameters so as to ...
DLOG
2007
13 years 10 months ago
2007
In this paper we deal with the problem of providing natural language front-ends to databases upon which an ontology layer has been added. Specifically, we are interested in expres...