264 search results - page 9 / 53 » On the possibility of faster SAT algorithms |
103
click to vote
JMLR
2010
14 years 6 months ago
2010
We present an algorithm name cSAT+ for learning the causal structure in a domain from datasets measuring different variable sets. The algorithm outputs a graph with edges correspo...
112
click to vote
FMCAD
2004
Springer
15 years 3 months ago
2004
Springer
This work presents a memory-efficient All-SAT engine which, given a propositional formula over sets of important and non-important variables, returns the set of all the assignments...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Structured output prediction is an important machine learning problem both in theory and practice, and the max-margin Markov network (M3 N) is an effective approach. All state-of-...
ICNP
2005
IEEE
15 years 5 months ago
2005
IEEE
Some of the fastest practical algorithms for IP route lookup are based on space-efficient encodings of multi-bit tries [1, 2]. Unfortunately, the time required by these algorithm...
132
click to vote
CODCRY
2011
Springer
14 years 3 months ago
2011
Springer
Fix positive integers B and w. Let C be a linear code over F2 of length Bw. The 2-regular-decoding problem is to find a nonzero codeword consisting of w length-B blocks, each of w...