914 search results - page 90 / 183 » The Computational Complexity of Probabilistic Planning |
135
click to vote
MMAS
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. When agents coordinate according to the principles of teamwork they can flexibly, robustly and reliably achieve complex goals in complex, dynamic and even hostile enviro...
146
click to vote
CRYPTO
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function fG(x1, . . . , xn) = x1 · x...
126
click to vote
UAI
2004
15 years 5 months ago
2004
As real-world Bayesian networks continue to grow larger and more complex, it is important to investigate the possibilities for improving the performance of existing algorithms of ...
105
click to vote
NIPS
2008
15 years 5 months ago
2008
This paper describes a recursive estimation procedure for multivariate binary densities using orthogonal expansions. For d covariates, there are 2d basis coefficients to estimate,...
150
click to vote
CSL
2003
Springer
15 years 9 months ago
2003
Springer
Many verification, planning, and control problems can be modeled as games played on state-transition graphs by one or two players whose conflicting goals are to form a path in th...