234 search results - page 8 / 47 » On the relative complexity of approximate counting problems |
ICML
2009
IEEE
14 years 8 months ago
2009
IEEE
Relational world models that can be learned from experience in stochastic domains have received significant attention recently. However, efficient planning using these models rema...
TCBB
2008
13 years 7 months ago
2008
The Nature Reserve Selection Problem is a problem that arises in the context of studying biodiversity conservation. Subject to budgetary constraints, the problem is to select a set...
CASC
2009
Springer
14 years 2 months ago
2009
Springer
This work addresses the problem of computing a certified ǫ-approximation of all real roots of a square-free integer polynomial. We proof an upper bound for its bit complexity, b...
DAGSTUHL
2004
13 years 9 months ago
2004
We study the intrinsic difficulty of solving linear parabolic initial value problems numerically at a single point. We present a worst case analysis for deterministic as well as fo...
ALGOSENSORS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We consider the problem of counting the number of indistinguishable targets using a simple binary sensing model. Our setting includes an unknown number of point targets i...