914 search results - page 81 / 183 » The Computational Complexity of Probabilistic Planning |
BMCBI
2007
2007
A high-accuracy consensus map of yeast protein complexes reveals modular nature of gene essentiality
14 years 12 months ago
Background: Identifying all protein complexes in an organism is a major goal of systems biology. In the past 18 months, the results of two genome-scale tandem affinity purificatio...
111
click to vote
COCO
2005
Springer
15 years 5 months ago
2005
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
CC
2007
Springer
14 years 12 months ago
2007
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
118
click to vote
JCB
2006
14 years 12 months ago
2006
Biological systems are traditionally studied by focusing on a specific subsystem, building an intuitive model for it, and refining the model using results from carefully designed ...
ENTCS
2008
14 years 12 months ago
2008
istic Abstract Interpretation of Imperative Programs using Truncated Normal Distributions Michael J. A. Smith1 ,2 Laboratory for Foundations of Computer Science University of Edinb...