727 search results - page 138 / 146 » A Calculus of Bounded Capacities |
102
click to vote
STOC
2006
ACM
16 years 2 days ago
2006
ACM
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs s1t1, s2t2, . . ., sktk, the goal is to maximize the number of pairs t...
110
click to vote
STOC
2003
ACM
16 years 1 days ago
2003
ACM
We describe a general technique for converting an online algorithm B to a truthtelling mechanism. We require that the original online competitive algorithm has certain "nicen...
WAOA
2007
Springer
15 years 5 months ago
2007
Springer
We consider the following distributed optimization problem: three agents i = 1, 2, 3 are each presented with a load drawn independently from the same known prior distribution. Then...
INFOCOM
2003
IEEE
15 years 5 months ago
2003
IEEE
— In this paper, we propose two schemes for the load balanced Birkhoff-von Neumann switches to provide guaranteed rate services. As in [7], the first scheme is based on an Earli...
104
click to vote
INFOCOM
2002
IEEE
15 years 4 months ago
2002
IEEE
— Optical Burst Switching (OBS) is an experimental network technology that enables the construction of very high capacity routers, using optical data paths and electronic control...