15073 search results - page 2617 / 3015 » Probabilistic algorithms for computing resultants |
163
click to vote
PLDI
1994
ACM
15 years 9 months ago
1994
ACM
As microprocessor speeds increase, memory bandwidth is increasing y the performance bottleneck for microprocessors. This has occurred because innovation and technological improvem...
139
click to vote
ICALP
1992
Springer
15 years 9 months ago
1992
Springer
Suppose that n tokens are arbitrarily placed on the n nodes of a graph. At each parallel step one token may be moved from each node to an adjacent node. An algorithm for the near-...
150
click to vote
STOC
1993
ACM
15 years 9 months ago
1993
ACM
Abstract. The subject of this paper is nding small sample spaces for joint distributions of n discrete random variables. Such distributions are often only required to obey a certa...
130
click to vote
WDAG
1990
Springer
15 years 9 months ago
1990
Springer
A distributed task T is 1-solvable if there exists a protocol that solves it in the presence of (at most) one crash failure. A precise characterization of the 1-solvable tasks was...
139
click to vote
ATAL
2006
Springer
15 years 8 months ago
2006
Springer
Distributed constraint optimization (DCOP) has emerged as a useful technique for multiagent coordination. While previous DCOP work focuses on optimizing a single team objective, i...