15485 search results - page 614 / 3097 » Computing Optimal Subsets |
184
click to vote
TRIDENTCOM
2006
IEEE
16 years 1 months ago
2006
IEEE
– This paper presents a reliable decentralized mutual exclusion algorithm for distributed systems in which processes communicate by asynchronous message passing. When any failure...
172
click to vote
SIGECOM
2005
ACM
16 years 23 days ago
2005
ACM
We study two problems, that of computing social optimum and that of finding fair allocations, in the congestion game model of Milchtaich[8] Although we show that the general prob...
178
click to vote
QOSIP
2005
Springer
16 years 21 days ago
2005
Springer
Abstract. Maintaining accurate network state information in the Traffic Engineering Databases of each node along a network is extremely difficult. The BYPASS Based Routing (BBR) me...
200
click to vote
PARA
2004
Springer
16 years 17 days ago
2004
Springer
The sparse Cholesky factorization of some large matrices can require a two dimensional partitioning of the matrix. The sparse hypermatrix storage scheme produces a recursive 2D par...
170
click to vote
DSN
2002
IEEE
16 years 5 days ago
2002
IEEE
Reliable multicast delivery requires that a multicast message be received by all members in a group. Hence certain or all members need to buffer messages for possible retransmissi...