3047 search results - page 512 / 610 » Randomized Parallel Selection |
108
Voted
SPAA
2010
ACM
15 years 7 months ago
2010
ACM
In this paper we study a dynamic version of capacity maximization in the physical model of wireless communication. In our model, requests for connections between pairs of points i...
145
click to vote
ICS
2009
Tsinghua U.
15 years 7 months ago
2009
Tsinghua U.
New static source routing algorithms for High Performance Computing (HPC) are presented in this work. The target parallel architectures are based on the commonly used fattree netw...
113
click to vote
AAIM
2007
Springer
15 years 6 months ago
2007
Springer
BitTorrent (BT) in practice is a very efficient method to share data over a network of clients. In this paper we extend the recent work of Arthur and Panigrahy [1] on modelling the...
111
click to vote
DEBS
2007
ACM
15 years 6 months ago
2007
ACM
We introduce SpiderCast, a distributed protocol for constructing scalable churn-resistant overlay topologies for supporting decentralized topic-based pub/sub communication. Spider...
104
click to vote
ICDCS
2010
IEEE
15 years 6 months ago
2010
IEEE
—Aspnes et al [2] introduced an innovative game for modeling the containment of the spread of viruses and worms (security breaches) in a network. In this model, nodes choose to i...