9842 search results - page 1359 / 1969 » Problem complexity |
257
click to vote
FOCS
2000
IEEE
15 years 11 months ago
2000
IEEE
In this article, we show several results obtained by combining the use of stable distributions with pseudorandom generators for bounded space. In particular: —We show that, for a...
207
Voted
PODC
2010
ACM
15 years 11 months ago
2010
ACM
We introduce Multi-Trials, a new technique for symmetry breaking for distributed algorithms and apply it to various problems in general graphs. For instance, we present three rand...
226
Voted
ATAL
2008
Springer
15 years 9 months ago
2008
Springer
In repeated games with incomplete information, rational agents must carefully weigh the tradeoffs of advantageously exploiting their information to achieve a short-term gain versu...
208
Voted
SIGECOM
2010
ACM
15 years 7 months ago
2010
ACM
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....
227
Voted
SPAA
2010
ACM
15 years 7 months ago
2010
ACM
We develop logarithmic approximation algorithms for extremely general formulations of multiprocessor multiinterval offline task scheduling to minimize power usage. Here each proce...