79 search results - page 12 / 16 » isaac 2009 |
148
click to vote
KDD
2009
ACM
15 years 9 months ago
2009
ACM
We consider negotiations between publishers and advertisers in a marketplace for ads. Motivated by Google’s online PrintAds system which is such a marketplace, we focus on the r...
110
click to vote
INFOCOM
2009
IEEE
15 years 11 months ago
2009
IEEE
— The Capacity Allocation Paradox (CAP) destabilizes a stable small-buffer network when a link capacity is increased. CAP is demonstrated in a basic 2x1 network topology. We show...
151
click to vote
ISAAC
2009
Springer
15 years 11 months ago
2009
Springer
We give a simple framework which is an alternative to the celebrated and widely used shifting strategy of Hochbaum and Maass [J. ACM, 1985] which has yielded efficient algorithms ...
147
click to vote
ISAAC
2009
Springer
15 years 11 months ago
2009
Springer
We consider some well-known families of two-player zero-sum perfect-information stochastic games played on finite directed graphs. Generalizing and unifying results of Liggett and...
143
click to vote
ISAAC
2009
Springer
15 years 9 months ago
2009
Springer
For a graph G and a collection of vertex pairs {(s1, t1), . . . , (sk, tk)}, the k disjoint paths problem is to find k vertex-disjoint paths P1, . . . , Pk, where Pi is a path fr...