672 search results - page 4 / 135 » Almost Optimal Dispersers |
STOC
2001
ACM
14 years 8 months ago
2001
ACM
FSTTCS
2006
Springer
14 years 6 days ago
2006
Springer
We consider timed games extended with cost information, and prove computability of the optimal cost and of -optimal memoryless strategies in timed games with one clock. In contrast...
JGO
2008
13 years 8 months ago
2008
Abstract. We deal with duality for almost convex finite dimensional optimization problems by means of the classical perturbation approach. To this aim some standard results from th...
COLT
2004
Springer
14 years 1 months ago
2004
Springer
We give the first polynomial time prediction strategy for any PAC-learnable class C that probabilistically predicts the target with mistake probability poly(log(t)) t = ˜O 1 t w...
ICMAS
1998
13 years 10 months ago
1998
This work presents a lookahead-based exploration strategy for a model-based learning agent that enables exploration of the opponent's behavior during interaction in a multi-a...