1308 search results - page 241 / 262 » Let's Have a Conversation |
GECCO
2003
Springer
15 years 4 months ago
2003
Springer
The MasterMind game involves decoding a secret code. The classic game is a code of six possible colors in four slots. The game has been analyzed and optimal strategies have been po...
STOC
2005
ACM
15 years 11 months ago
2005
ACM
We present new explicit constructions of deterministic randomness extractors, dispersers and related objects. We say that a distribution X on binary strings of length n is a -sour...
100
Voted
SAGA
2007
Springer
15 years 5 months ago
2007
Springer
We consider applications of probabilistic techniques in the framework of algorithmic game theory. We focus on three distinct case studies: (i) The exploitation of the probabilistic...
PODC
2010
ACM
15 years 2 months ago
2010
ACM
: The Borowsky-Gafni (BG) simulation algorithm is a powerful reduction algorithm that shows that t-resilience of decision tasks can be fully characterized in terms of wait-freedom....
GC
2007
Springer
14 years 11 months ago
2007
Springer
We localize and strengthen Katona’s idea of an edge-toughness to a local topological toughness. We disprove a conjecture of Katona concerning the connection between edgetoughnes...