511 search results - page 33 / 103 » Lower bounds for distributed markov chain problems |
ECCV
2000
Springer
15 years 4 months ago
2000
Springer
Abstract. Condensation is a popular algorithm for sequential inference that resamples a sampled representation of the posterior. The algorithm is known to be asymptotically correct...
104
click to vote
ECCC
2010
14 years 12 months ago
2010
We study a variant of the classical circuit-lower-bound problems: proving lower bounds for sampling distributions given random bits. We prove a lower bound of 1 - 1/n(1) on the st...
AAAI
2006
15 years 1 months ago
2006
Model counting is the classical problem of computing the number of solutions of a given propositional formula. It vastly generalizes the NP-complete problem of propositional satis...
110
click to vote
AAAI
2011
13 years 11 months ago
2011
In environmental and natural resource planning domains actions are taken at a large number of locations over multiple time periods. These problems have enormous state and action s...
122
click to vote
TC
2002
14 years 11 months ago
2002
We investigate whether asynchronous computational models and asynchronous algorithms can be considered for designing real-time distributed fault-tolerant systems. A priori, the lac...