11 search results - page 2 / 3 » An Exponential Lower Bound for the Parity Game Strategy Impr... |
CORR
2008
Springer
13 years 5 months ago
2008
Springer
We consider concurrent games played on graphs. At every round of the game, each player simultaneously and independently selects a move; the moves jointly determine the transition ...
AIEDAM
2008
13 years 5 months ago
2008
Although it is known that quantum computers can solve certain computational problems exponentially faster than classical computers, only a small number of quantum algorithms have ...
IPCO
2010
13 years 7 months ago
2010
Abstract. We consider two-person zero-sum stochastic mean payoff games with perfect information, or BWR-games, given by a digraph G = (V = VB VW VR, E), with local rewards r : E R...
FOCS
1993
IEEE
13 years 10 months ago
1993
IEEE
We consider the following scenario. A point robot is placed at some start location ¡ in a 2dimensional scene containing oriented rectangular obstacles. The robot must repeatedly ...
STOC
2007
ACM
14 years 6 months ago
2007
ACM
In this work, we consider the problems of testing whether a distribution over {0, 1}n is k-wise (resp. ( , k)-wise) independent using samples drawn from that distribution. For the...