77 search results - page 15 / 16 » Optimizing over the split closure |
INFOCOM
2006
IEEE
14 years 1 months ago
2006
IEEE
—We consider routing games where the performance of each user is dictated by the worst (bottleneck) element it employs. We are given a network, finitely many (selfish) users, eac...
SIGCOMM
2005
ACM
14 years 1 months ago
2005
ACM
We consider the problem of routing in a delay tolerant network (DTN) in the presence of path failures. Previous work on DTN routing has focused on using precisely known network dy...
CN
2007
13 years 7 months ago
2007
We present a mechanism for auctioning bandwidth on a network-wide basis to end users or ISPs that will utilize it for the same time period. This mechanism consists of a set of sim...
ACL
2003
13 years 9 months ago
2003
We demonstrate that an unlexicalized PCFG can parse much more accurately than previously shown, by making use of simple, linguistically motivated state splits, which break down fa...
ISCAPDCS
2004
13 years 9 months ago
2004
The cache hierarchy design in existing SMT and superscalar processors is optimized for latency, but not for bandwidth. The size of the L1 data cache did not scale over the past de...