914 search results - page 48 / 183 » The Computational Complexity of Probabilistic Planning |
FOCS
1999
IEEE
14 years 2 months ago
1999
IEEE
We present a simple probabilistic algorithm for solving kSAT, and more generally, for solving constraint satisfaction problems (CSP). The algorithm follows a simple localsearch pa...
TCOM
2010
13 years 9 months ago
2010
Abstract—In this letter, we propose an extension of the probabilistic tree pruning sphere decoding (PTP-SD) algorithm that provides further improvement of the computational compl...
ICICS
2004
Springer
14 years 4 months ago
2004
Springer
Abstract. The NRL Pump protocol defines a multilevel secure component whose goal is to minimize leaks of information from high level systems to lower level systems, without degrad...
FLAIRS
2008
14 years 29 days ago
2008
We are interested in building decision-support software for social welfare case managers. Our model in the form of a factored Markov decision process is so complex that a standard...
CCGRID
2008
IEEE
14 years 19 days ago
2008
IEEE
Production grids are complex and highly variable systems whose behavior is not well understood and difficult to anticipate. The goal of this study is to estimate the impact of the ...