49 search results - page 2 / 10 » Approximate Counting by Sampling the Backtrack-free Search S... |
138
click to vote
SEMWEB
2007
Springer
15 years 11 months ago
2007
Springer
Recent research on model counting in CNF formulas has shown that a certain sampling method can yield results that are sound with a provably high probability. The key idea is to ite...
151
Voted
SAT
2005
Springer
15 years 10 months ago
2005
Springer
We introduce ApproxCount, an algorithm that approximates the number of satisfying assignments or models of a formula in propositional logic. Many AI tasks, such as calculating degr...
155
Voted
COMPGEOM
2009
ACM
15 years 12 months ago
2009
ACM
We present cache-oblivious solutions to two important variants of range searching: range reporting and approximate range counting. Our main contribution is a general approach for ...
144
click to vote
FOCS
1996
IEEE
15 years 9 months ago
1996
IEEE
A common subproblem of DNF approximate counting and derandomizing RL is the discrepancy problem for combinatorial rectangles. We explicitly construct a poly(n)-size sample space t...
155
click to vote
COMPGEOM
1995
ACM
15 years 9 months ago
1995
ACM
The range searching problem is a fundamental problem in computational geometry, with numerous important applications. Most research has focused on solving this problem exactly, bu...