1615 search results - page 268 / 323 » Computer science and decision theory |
144
click to vote
STOC
2004
ACM
16 years 4 months ago
2004
ACM
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
ICS
2010
Tsinghua U.
16 years 1 months ago
2010
Tsinghua U.
feuse of its devstting eets in utions nd other mehnismsD ollusion is prohiited nd leglly proseutedF etD olluders hve lwys existedD nd my ontinue to existF e thus rise the followin...
130
click to vote
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
— The question of whether or not parallel repetition reduces the soundness error is a fundamental question in the theory of protocols. While parallel repetition reduces (at an ex...
126
click to vote
FOCS
2008
IEEE
15 years 10 months ago
2008
IEEE
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandom number generators do not exist. This famous result is...
192
click to vote
STOC
1994
ACM
15 years 8 months ago
1994
ACM
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...