6105 search results - page 811 / 1221 » A Parallel Algorithm for Bound-Smoothing |
181
click to vote
PODC
2009
ACM
16 years 7 months ago
2009
ACM
d Abstract] Christoph Lenzen Computer Engineering and Networks Laboratory (TIK) ETH Zurich, 8092 Zurich, Switzerland lenzen@tik.ee.ethz.ch Thomas Locher Computer Engineering and N...
147
click to vote
GCC
2007
Springer
16 years 1 months ago
2007
Springer
Coordinates-based distance prediction algorithms can improve the performance of many Internet applications, especially in the peer-to-peer architecture and overlay construction. B...
177
click to vote
PODC
2005
ACM
16 years 11 days ago
2005
ACM
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
186
click to vote
SPAA
2005
ACM
16 years 11 days ago
2005
ACM
We study the admission control problem in general networks. Communication requests arrive over time, and the online algorithm accepts or rejects each request while maintaining the...
180
click to vote
HPDC
2003
IEEE
16 years 3 days ago
2003
IEEE
Abstract. We present PlanetP, a peer-to-peer (P2P) content search and retrieval infrastructure targeting communities wishing to share large sets of text documents. P2P computing is...