605 search results - page 10 / 121 » Probabilistic state space search |
CONCUR
2001
Springer
13 years 12 months ago
2001
Springer
We study the maximal reachability probability problem for infinite-state systems featuring both nondeterministic and probabilistic choice. The problem involves the computation of ...
IJCAI
2003
13 years 8 months ago
2003
For probabilistic reasoning, one often needs to sample from a combinatorial space. For example, one may need to sample uniformly from the space of all satisfying assignments. Can ...
MICAI
2005
Springer
14 years 29 days ago
2005
Springer
Abstract. Kernel based methods (such as k-nearest neighbors classifiers) for AI tasks translate the classification problem into a proximity search problem, in a space that is usu...
NIPS
2003
13 years 8 months ago
2003
We describe a new approximation algorithm for solving partially observable MDPs. Our bounded policy iteration approach searches through the space of bounded-size, stochastic fini...
EDBT
2010
ACM
13 years 9 months ago
2010
ACM
The availability of indoor positioning renders it possible to deploy location-based services in indoor spaces. Many such services will benefit from the efficient support for k n...