914 search results - page 151 / 183 » The Computational Complexity of Probabilistic Planning |
TACAS
2010
Springer
14 years 3 months ago
2010
Springer
Deciding whether a modal formula is satisfiable with respect to a given set of (global) assumptions is a question of fundamental importance in applications of logic in computer sc...
IDEAL
2004
Springer
14 years 2 months ago
2004
Springer
Building genetic regulatory networks from time series data of gene expression patterns is an important topic in bioinformatics. Probabilistic Boolean networks (PBNs) have been deve...
ICALP
2001
Springer
14 years 1 months ago
2001
Springer
Abstract. We present the first private information retrieval (PIR) scheme which is both, deterministically correct and has poly-logarithmic communication complexity. Our PIR proto...
JACM
2006
13 years 8 months ago
2006
Parallel independent disks can enhance the performance of external memory (EM) algorithms, but the programming task is often di cult. In this paper we develop randomized variants ...
CORR
2002
Springer
13 years 8 months ago
2002
Springer
Many systems that exhibit nonmonotonic behavior have been described and studied already in the literature. The general notion of nonmonotonic reasoning, though, has almost always ...