658 search results - page 98 / 132 » Lower bounds for sorting networks |
APPROX
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. In this paper, we consider two new online optimization problems (each with several variants), present similar online algorithms for both, and show that one reduces to the...
WINE
2007
Springer
14 years 1 months ago
2007
Springer
We study the frugality ratio of truthful mechanisms in path auctions, which measures the extent to which truthful mechanisms “overpay” compared to non-truthful mechanisms. In p...
INFOCOM
2005
IEEE
14 years 1 months ago
2005
IEEE
— We prove that the XCP equilibrium solves a constrained max-min fairness problem by identifying it with the unique solution of a hierarchy of optimization problems, namely those...
FUN
2010
Springer
14 years 15 days ago
2010
Springer
We consider a class of highly dynamic networks modelled on an urban subway system. We examine the problem of creating a map of such a subway in less than ideal conditions, where th...
SODA
2004
ACM
13 years 9 months ago
2004
ACM
We introduce the Bloomier filter, a data structure for compactly encoding a function with static support in order to support approximate evaluation queries. Our construction gener...