210 search results - page 41 / 42 » Excludability and Bounded Computational Capacity |
ISTCS
1997
Springer
14 years 1 months ago
1997
Springer
We introduce the k-payment problem: given a total budget of N units, the problem is to represent this budget as a set of coins, so that any k exact payments of total value at most ...
CONEXT
2010
ACM
13 years 7 months ago
2010
ACM
Fundamental limitations of traditional data center network architectures have led to the development of architectures that provide enormous bisection bandwidth for up to hundreds ...
IMC
2009
ACM
14 years 4 months ago
2009
ACM
Since the last in-depth studies of measured TCP traffic some 68 years ago, the Internet has experienced significant changes, including the rapid deployment of backbone links wit...
COMSWARE
2007
IEEE
14 years 4 months ago
2007
IEEE
In this paper we are concerned with finding the maximum throughput that a mobile ad hoc network can support. Even when nodes are stationary, the problem of determining the capaci...
SIGECOM
2005
ACM
14 years 3 months ago
2005
ACM
We study first-price auction mechanisms for auctioning flow between given nodes in a graph. A first-price auction is any auction in which links on winning paths are paid their ...