1034 search results - page 86 / 207 » Competitive generalized auctions |
110
click to vote
ICALP
2001
Springer
15 years 7 months ago
2001
Springer
In contrast to classical offline k-k routing, the online packet routing problem allows for an arbitrary number of packets with arbitrary end points and release times. We study this...
115
click to vote
ICPP
1998
IEEE
15 years 6 months ago
1998
IEEE
We address the problems of I/O scheduling and buffer management for general reference strings in a parallel I/O system. Using the standard parallel disk model withD disks and a sh...
114
click to vote
SODA
2008
ACM
15 years 4 months ago
2008
ACM
We consider the problem of minimizing average latency cost while obliviously routing traffic in a network with linear latency functions. This is roughly equivalent to minimizing t...
128
click to vote
ALGORITHMICA
2010
15 years 2 months ago
2010
Given a cellular (mobile telephone) network, whose geographical coverage area is divided into hexagonal cells, phone calls are serviced by assigning frequencies to them so that no...
117
click to vote
SPAA
2004
ACM
15 years 8 months ago
2004
ACM
This paper considers the problem of packet-mode scheduling of input queuedswitches. Packets have variable lengths, and are divided into cells of unit length. Each packet arrives t...