4255 search results - page 79 / 851 » On Learning Boolean Functions |
ICML
2004
IEEE
15 years 3 months ago
2004
IEEE
COLT
1994
Springer
15 years 1 months ago
1994
Springer
103
click to vote
SAT
2005
Springer
15 years 3 months ago
2005
Springer
Solvers for Quantified Boolean Formulae (QBF) use many analogues of technique from SAT. A significant amount of work has gone into extending conflict based techniques such as co...
IJCAI
1993
14 years 11 months ago
1993
The Dempster-Shafer theory gives a solid basis for reasoning applications characterized by uncertainty. A key feature of the theory is that propositions are represented as subsets...
111
click to vote
COCO
2011
Springer
13 years 9 months ago
2011
Springer
We consider a system of linear constraints over any finite Abelian group G of the following form: i(x1, . . . , xn) ≡ i,1x1 + · · · + i,nxn ∈ Ai for i = 1, . . . , t and e...