107 search results - page 12 / 22 » When Random Play is Optimal Against an Adversary |
ACMACE
2009
ACM
14 years 5 days ago
2009
ACM
How do games effect the way we problem solve, socialize, or even view the world? When we shoot do we learn to destroy obstacles instead of work around them? Does the binary world ...
SODA
2010
ACM
14 years 4 months ago
2010
ACM
We consider a robust model proposed by Scarf, 1958, for stochastic optimization when only the marginal probabilities of (binary) random variables are given, and the correlation be...
ICDT
2009
ACM
14 years 8 months ago
2009
ACM
We continue the study of approximating the number of distinct elements in a data stream of length n to within a (1? ) factor. It is known that if the stream may consist of arbitra...
STACS
2005
Springer
14 years 29 days ago
2005
Springer
Abstract. The dynamic page migration problem [4] is defined in a distributed network of n mobile nodes sharing one indivisible memory page of size D. During runtime, the nodes can...
CHES
2006
Springer
13 years 11 months ago
2006
Springer
In cryptography it is assumed that adversaries only have black box access to the secret keys of honest parties. In real life, however, the black box approach is not sufficient beca...