107 search results - page 15 / 22 » When Random Play is Optimal Against an Adversary |
ACCV
2010
Springer
13 years 2 months ago
2010
Springer
We present a method for optimizing the stereo matching process when it is applied to a series of images with similar depth structures. We observe that there are similar regions wit...
STOC
2003
ACM
14 years 7 months ago
2003
ACM
The problem of cooperatively performing a set of t tasks in a decentralized setting where the computing medium is subject to failures is one of the fundamental problems in distrib...
SIGMETRICS
2002
ACM
13 years 7 months ago
2002
ACM
On-line routing algorithms deal with requests as they arrive without assuming any knowledge of the underlying process that generates the streams of requests. By contrast, off-line...
ASIACRYPT
2007
Springer
13 years 11 months ago
2007
Springer
Secure multi-party computation (MPC) allows a set of n players to securely compute an agreed function of their inputs, even when up to t players are under the control of an adversa...
AAAI
2008
13 years 9 months ago
2008
ion-Based Versus Potential-Aware Automated Abstraction in Imperfect Information Games: An Experimental Comparison Using Poker Andrew Gilpin and Tuomas Sandholm Computer Science Dep...