16596 search results - page 2920 / 3320 » Generalized Assignment Problems |
191
click to vote
PODC
2005
ACM
16 years 1 months ago
2005
ACM
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
177
click to vote
PODC
2005
ACM
16 years 1 months ago
2005
ACM
A quorum system is a family of sets (themselves called quorums), each pair of which intersect. In many distributed algorithms, the basic unit accessed by a client is a quorum of n...
213
click to vote
PODC
2005
ACM
16 years 1 months ago
2005
ACM
We study the distributed complexity of computing a maximal independent set (MIS) in radio networks with completely unknown topology, asynchronous wake-up, and no collision detecti...
228
click to vote
SBCCI
2005
ACM
16 years 1 months ago
2005
ACM
This work addresses the problem of application mapping in networks-on-chip (NoCs). It explores the importance of characterizing network traffic to effectively predict NoC energy c...
176
click to vote
SIGCOMM
2005
ACM
16 years 1 months ago
2005
ACM
IP anycast, with its innate ability to find nearby resources in a robust and efficient fashion, has long been considered an important means of service discovery. The growth of P2...