74 search results - page 3 / 15 » Random Debaters and the Hardness of Approximating Stochastic... |
RANDOM
1998
Springer
14 years 3 months ago
1998
Springer
Abstract. Redundancy has been utilized to achieve fault tolerant computation and to achieve reliable communication in networks of processors. These techniques can only be extended ...
TOMACS
2010
13 years 5 months ago
2010
In this paper, we develop a stochastic approximation method to solve a monotone estimation problem and use this method to enhance the empirical performance of the Q-learning algor...
ECAI
2010
Springer
13 years 12 months ago
2010
Springer
Abstract. We address the problem of continuous stochastic optimal control in the presence of hard obstacles. Due to the non-smooth character of the obstacles, the traditional appro...
AAAI
1997
14 years 6 days ago
1997
We present empirical evidence that the distribution of e ort required to solve CSPs randomly generated at the 50% satis able point, when using a backtracking algorithm, can be app...
EOR
2006
13 years 11 months ago
2006
In this paper, we present a stochastic model for the dynamic fleet management problem with random travel times. Our approach decomposes the problem into time-staged subproblems by...