147 search results - page 6 / 30 » An optimal lower bound for anonymous scheduling mechanisms |
WINE
2009
Springer
15 years 4 months ago
2009
Springer
We study the geometrical shape of the partitions of the input space created by the allocation rule of a truthful mechanism for multi-unit auctions with multidimensional types and ...
100
click to vote
CJ
2006
14 years 9 months ago
2006
Anonymous channels or similar techniques that can achieve sender's anonymity play important roles in many applications. However, they will be meaningless if cryptographic prim...
79
Voted
CORR
2004
Springer
14 years 9 months ago
2004
Springer
Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. In the context of a branch-and-bound framewo...
EUROPAR
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. We consider parallel prefix computation on processors of different and possibly changing speeds. Extending previous works on identical processors, we provide a lower boun...
82
Voted
IPPS
2000
IEEE
15 years 1 months ago
2000
IEEE
In this paper, we study the problem of on demand minimum length packet scheduling in single-hop multichannel systems. Examples of these systems are those centered around switching...