674 search results - page 59 / 135 » The computational complexity of the parallel knock-out probl... |
106
click to vote
ESCIENCE
2006
IEEE
15 years 5 months ago
2006
IEEE
In this paper we present a general domain for the analysis of workflows and workflow components based on the notion of a collection of Turing machines sharing a set of tapes. We s...
STOC
2010
ACM
15 years 10 months ago
2010
ACM
We prove that the complexity class QIP, which consists of all problems having quantum interactive proof systems, is contained in PSPACE. This containment is proved by applying a p...
115
click to vote
HIPC
2005
Springer
15 years 7 months ago
2005
Springer
We consider the problem of sensor selection so as to minimise error in estimated location of target. An algorithm based on selecting a sensor in a direction in which the error is ...
126
click to vote
PPOPP
1999
ACM
15 years 5 months ago
1999
ACM
A central problem in executing performance critical parallel and distributed applications on shared networks is the selection of computation nodes and communication paths for exec...
117
click to vote
JMLR
2010
14 years 8 months ago
2010
We consider the problem of correcting the posterior marginal approximations computed by expectation propagation and Laplace approximation in latent Gaussian models and propose cor...