2027 search results - page 330 / 406 » When is it best to best-respond |
118
click to vote
STOC
2003
ACM
16 years 1 months 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...
175
Voted
SIGMOD
2009
ACM
16 years 1 months ago
2009
ACM
Reachability queries on large directed graphs have attracted much attention recently. The existing work either uses spanning structures, such as chains or trees, to compress the c...
122
click to vote
PERCOM
2008
ACM
16 years 12 days ago
2008
ACM
Existing code update protocols for reprogramming nodes in a sensor network are either unsuitable or inefficient when used in a mobile environment. The prohibitive factor of uncert...
72
Voted
DCC
2006
IEEE
16 years 11 days ago
2006
IEEE
Abstract. We propose measures for compressed data structures, in which space usage is measured in a data-aware manner. In particular, we consider the fundamental dictionary problem...
PPOPP
2010
ACM
15 years 10 months ago
2010
ACM
Drawing inspiration from several previous projects, we present an ownership-record-free software transactional memory (STM) system that combines extremely low overhead with unusua...