Absolute expediency of Q-and S-model learning algorithms

Lakshmivarahan, S. ; Thathachar, M. A. L. (1976) Absolute expediency of Q-and S-model learning algorithms IEEE Transactions on Systems, Man, and Cybernetics, SMC-6 (3). pp. 222-226. ISSN 0018-9472

Full text not available from this repository.

Official URL: http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumb...

Related URL: http://dx.doi.org/10.1109/TSMC.1976.5409242


A class of nonlinear learning algorithms for the Q-and S-model stochastic automaton-random environment setup are described. Necessary and sufficient conditions for absolute expediency of these algorithms are derived. Various algorithms that are so far reported in literature can be obtained as special cases of the general algorithm given in this correspondence.

Item Type:Article
Source:Copyright of this article belongs to IEEE.
ID Code:51326
Deposited On:28 Jul 2011 11:56
Last Modified:28 Jul 2011 11:56

Repository Staff Only: item control page