50 search results - page 6 / 10 » Exact Sampling and Approximate Counting Techniques |
IJCAI
2001
13 years 10 months ago
2001
A new, general approach is described for approximate inference in first-order probabilistic languages, using Markov chain Monte Carlo (MCMC) techniques in the space of concrete po...
ECAI
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. We address the problem of continuous stochastic optimal control in the presence of hard obstacles. Due to the non-smooth character of the obstacles, the traditional appro...
COMGEO
2007
ACM
13 years 8 months ago
2007
ACM
We consider the problem of discovering a smooth unknown surface S bounding an object O in R3 . The discovery process consists of moving a point probing device in the free space ar...
ALGORITHMICA
2005
13 years 8 months ago
2005
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...
ATAL
2005
Springer
14 years 2 months ago
2005
Springer
State estimation consists of updating an agent’s belief given executed actions and observed evidence to date. In single agent environments, the state estimation can be formalize...