914 search results - page 92 / 183 » The Computational Complexity of Probabilistic Planning |
132
click to vote
FOCS
2000
IEEE
15 years 8 months ago
2000
IEEE
We show that the graph isomorphism problem is hard under DLOGTIME uniform AC0 many-one reductions for the complexity classes NL, PL (probabilistic logarithmic space) for every loga...
182
click to vote
ACIVS
2006
Springer
15 years 8 months ago
2006
Springer
Scene understanding is an important problem in intelligent robotics. Since visual information is uncertain due to several reasons, we need a novel method that has robustness to the...
139
click to vote
DAC
1995
ACM
15 years 7 months ago
1995
ACM
- Power estimation in combinational modules is addressed from a probabilistic point of view. The zero-delay hypothesis is considered and under highly correlated input streams, the ...
237
click to vote
SIGMOD
2009
ACM
16 years 4 months ago
2009
ACM
Composite (or Complex) event processing (CEP) systems search sequences of incoming events for occurrences of userspecified event patterns. Recently, they have gained more attentio...
155
click to vote
ICRA
2003
IEEE
15 years 9 months ago
2003
IEEE
— As people move through their environments, they do not move randomly. Instead, they are often engaged in typical motion patterns, related to specific locations they might be i...