914 search results - page 126 / 183 » The Computational Complexity of Probabilistic Planning |
ICPR
2002
IEEE
14 years 10 months ago
2002
IEEE
Classification of real-world data poses a number of challenging problems. Mismatch between classifier models and true data distributions on one hand and the use of approximate inf...
CVPR
2012
IEEE
11 years 11 months ago
2012
IEEE
Recent work on background subtraction has shown developments on two major fronts. In one, there has been increasing sophistication of probabilistic models, from mixtures of Gaussi...
JELIA
2004
Springer
14 years 2 months ago
2004
Springer
Logical formalisation of agent behaviour is desirable, not only in order to provide a clear semantics of agent-based systems, but also to provide the foundation for sophisticated r...
SIGMETRICS
2004
ACM
14 years 2 months ago
2004
ACM
The performance of IP networks depends on a wide variety of dynamic conditions. Traffic shifts, equipment failures, planned maintenance, and topology changes in other parts of th...
TROB
2002
13 years 8 months ago
2002
This paper uses a configuration space ( -space) based method to compute interference-free configuration for stacking polyhedral sheet metal parts. This work forms the interference ...