12659 search results - page 434 / 2532 » The distributed breakout algorithms |
208
click to vote
STOC
1994
ACM
15 years 11 months ago
1994
ACM
Shannon's Coding Theorem shows that in order to reliably transmit a message of T bits over a noisy communication channel, only a constant slowdown factor is necessary in the ...
209
click to vote
IWMM
1992
Springer
15 years 11 months ago
1992
Springer
Abstract. Automatic storage management is important in highly parallel programming environments where large numbers of objects and processes are being constantly created and discar...
198
click to vote
COLT
2006
Springer
15 years 11 months ago
2006
Springer
Abstract. We present a unified and complete account of maximum entropy distribution estimation subject to constraints represented by convex potential functions or, alternatively, b...
183
click to vote
WDAG
2000
Springer
15 years 11 months ago
2000
Springer
This paper presents a study of a distributed cooperation problem under the assumption that processors may not be able to communicate for a prolonged time. The problem for n proces...
187
click to vote
ATAL
2010
Springer
15 years 8 months ago
2010
Springer
Increasing teamwork between agents typically increases the performance of a multi-agent system, at the cost of increased communication and higher computational complexity. This wo...