2924 search results - page 261 / 585 » Lower Bounds in Distributed Computing |
130
click to vote
CCCG
2010
15 years 5 months ago
2010
In this paper we devise a new geometric spanner based on a generalization of the known Stable Roommates algorithm. This spanner is on the "path" between the Yao graph an...
123
click to vote
DAGSTUHL
2006
15 years 5 months ago
2006
We bound the future loss when predicting any (computably) stochastic sequence online. Solomonoff finitely bounded the total deviation of his universal predictor M from the true dis...
132
click to vote
SPAA
1996
ACM
15 years 8 months ago
1996
ACM
In this paper, we analyze the performance of parallel multithreaded algorithms that use dag-consistent distributed shared memory. Specifically, we analyze execution time, page fau...
143
click to vote
MMSYS
2012
13 years 11 months ago
2012
Increasingly, commercial content providers (CPs) offer streaming and IPTV solutions that leverage an underlying peerto-peer (P2P) stream distribution architecture. The use of P2P...
128
click to vote
ICPP
1998
IEEE
15 years 7 months ago
1998
IEEE
In this paper, we propose a real-time communication scheme that can be used in general point-to-point real-time multicomputer systems with wormhole switching. Real-time communicat...