14084 search results - page 2502 / 2817 » A Theory for Game Theories |
182
click to vote
STOC
2004
ACM
16 years 7 months ago
2004
ACM
We consider several classical models in deterministic inventory theory: the single-item lot-sizing problem, the joint replenishment problem, and the multi-stage assembly problem. ...
195
click to vote
STOC
2003
ACM
16 years 7 months ago
2003
ACM
The design of new quantum algorithms has proven to be an extremely difficult task. This paper considers a different approach to the problem, by studying the problem of 'quant...
167
click to vote
STOC
2003
ACM
16 years 7 months ago
2003
ACM
Improving an old result of Clarkson et al., we show that the number of distinct distances determined by a set P of n points in three-dimensional space is (n77/141) = (n0.546 ), fo...
182
click to vote
STOC
2003
ACM
16 years 7 months ago
2003
ACM
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
275
Voted
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
Correlation Clustering was defined by Bansal, Blum, and Chawla as the problem of clustering a set of elements based on a possibly inconsistent binary similarity function between e...