Q-Learning Algorithms with Random Truncation Bounds and Applications to Effective Parallel Computing
- 12 December 2007
- journal article
- research article
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 137 (2) , 435-451
- https://doi.org/10.1007/s10957-007-9331-9
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Asymptotic properties of sign algorithms for adaptive filteringIEEE Transactions on Automatic Control, 2003
- Optimal remapping in dynamic bulk synchronous computations via a stochastic control approachIEEE Transactions on Parallel and Distributed Systems, 2003
- On W.P.1 Convergence of A Parallel Stochastic Approximation AlgorithmProbability in the Engineering and Informational Sciences, 1989
- Stochastic approximation algorithms for parallel and distributed processingStochastics, 1987
- Asymptotic Properties of Distributed and Communicating Stochastic Approximation AlgorithmsSIAM Journal on Control and Optimization, 1987