5448 search results - page 396 / 1090 » Breakpoints and Time in Distributed Computations |
192
click to vote
ATAL
2004
Springer
16 years 5 days ago
2004
Springer
This paper presents protocols and strategies for coalition formation with incomplete information under time constraints. It focuses on strategies for coalition members to distribu...
152
click to vote
ICPP
2006
IEEE
16 years 25 days ago
2006
IEEE
We present the first parallel algorithm for building a Hausdorff Voronoi diagram (HVD). Our algorithm is targeted towards cluster computing architectures and computes the Hausdor...
148
click to vote
IPPS
1999
IEEE
15 years 11 months ago
1999
IEEE
The paper introduces a family of scheduling problems called fault-tolerant programs scheduling FTPS. Since FTPS problems are, in general, computationally di cult, a challenge is to...
192
click to vote
HIPC
2004
Springer
16 years 5 days ago
2004
Springer
Abstract. Lock-free shared data structures in the setting of distributed computing have received a fair amount of attention. Major motivations of lock-free data structures include ...
159
click to vote
LCN
2007
IEEE
16 years 1 months ago
2007
IEEE
— With an enhanced client computer performance and network bandwidth, peer-to-peer (P2P) content distribution networks are receiving much attention. However, along with the popul...