341 search results - page 45 / 69 » Learning to satisfy |
COLT
2004
Springer
13 years 11 months ago
2004
Springer
For hyper-rectangles in Rd Auer et al. [1] proved a PAC bound of O 1 (d + log 1 ) , where and are the accuracy and confidence parameters. It is still an open question whether one...
JSAT
2006
13 years 7 months ago
2006
This paper introduces a new hybrid method for efficiently integrating Pseudo-Boolean (PB) constraints into generic SAT solvers in order to solve PB satisfiability and optimization...
KDD
2007
ACM
14 years 8 months ago
2007
ACM
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
IPMU
2010
Springer
14 years 12 days ago
2010
Springer
We introduce a general definition for the independence of a number of finite-valued variables, based on coherent lower previsions. Our definition has an epistemic flavour: it a...
EUROCRYPT
2001
Springer
14 years 3 days ago
2001
Springer
Abstract. We consider the question of protecting the privacy of customers buying digital goods. More specifically, our goal is to allow a buyer to purchase digital goods from a ve...