2950 search results - page 10 / 590 » Computing with Infinitely Many Processes |
149
click to vote
WDAG
2007
Springer
15 years 10 months ago
2007
Springer
We study adaptive routing algorithms in a round-based model. Suppose we are given a network equipped with load-dependent latency functions on the edges and a set of commodities eac...
126
click to vote
ISAAC
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Set agreement is a fundamental problem in distributed computing in which processes collectively choose a small subset of values from a larger set of proposals. The imposs...
152
click to vote
ACSC
2002
IEEE
15 years 9 months ago
2002
IEEE
Negotiation is a process in which two or more parties with different criteria, constraints, and preferences, jointly reach an agreement on the terms of a transaction. Many current...
150
click to vote
INFOCOM
2009
IEEE
15 years 11 months ago
2009
IEEE
—While it is a well known result that network coding achieves optimal flow rates in multicast sessions, its potential for practical use has remained to be a question, due to its...
124
click to vote
TPDS
1998
15 years 4 months ago
1998
—A matrix A of size m n containing items from a totally ordered universe is termed monotone if, for every i, j, 1 i < j m, the minimum value in row j lies below or to...