By Topic

Absolute Expediency of Q-and S-Model Learning Algorithms

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
S. Lakshmivarahan ; Computer Center, Indian Institute of Technology, Madras, India. ; M. A. L. Thathachar

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.

Published in:

IEEE Transactions on Systems, Man, and Cybernetics  (Volume:SMC-6 ,  Issue: 3 )