15073 search results - page 102 / 3015 » Probabilistic algorithms for computing resultants |
160
click to vote
PRDC
2007
IEEE
15 years 9 months ago
2007
IEEE
We consider scheduling real-time distributable threads in the presence of node/link failures and message losses in large-scale network systems. We present a distributed scheduling...
137
Voted
RSFDGRC
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. In this paper, we revisit the consensus of computational complexity on exact inference in Bayesian networks. We point out that even in singly connected Bayesian networks,...
116
Voted
WDAG
1989
Springer
15 years 7 months ago
1989
Springer
We focus on unreliable asynchronous shared memory model which support only atomic read and write operations. For such a model we provide a necessary condition for the solvability ...
129
click to vote
ENTCS
2007
15 years 3 months ago
2007
d abstract) Paolo Zuliani 1 Department of Computer Science Princeton University Princeton, NJ 08544, USA In this paper we offer a programming approach to quantum computation usin...
137
click to vote
COCO
2009
Springer
15 years 10 months ago
2009
Springer
—Consider the following Simultaneous Message Passing (SMP) model for computing a relation f ⊆ X ×Y ×Z. In this model Alice, on input x ∈ X and Bob, on input y ∈ Y, send o...