914 search results - page 177 / 183 » The Computational Complexity of Probabilistic Planning |
SWAT
2004
Springer
15 years 5 months ago
2004
Springer
Let A and B be two sets of n resp. m disjoint unit disks in the plane, with m ≥ n. We consider the problem of finding a translation or rigid motion of A that maximizes the tota...
134
click to vote
STOC
2010
ACM
15 years 3 months ago
2010
ACM
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
AAAI
2008
15 years 2 months ago
2008
In artificial intelligence and pervasive computing research, inferring users' high-level goals from activity sequences is an important task. A major challenge in goal recogni...
FC
2008
Springer
15 years 1 months ago
2008
Springer
We present an efficient off-line divisible e-cash scheme which is truly anonymous without a trusted third party. This is the second scheme in the literature which achieves full unl...
113
click to vote
DAGSTUHL
2007
15 years 1 months ago
2007
Abstract. In this paper, we consider the problem of filtering in relational hidden Markov models. We present a compact representation for such models and an associated logical par...