• DocumentCode
    1412447
  • Title

    Absolute Expediency of Q-and S-Model Learning Algorithms

  • Author

    Lakshmivarahan, S. ; Thathachar, M. A L

  • Author_Institution
    Computer Center, Indian Institute of Technology, Madras, India.
  • Issue
    3
  • fYear
    1976
  • fDate
    3/1/1976 12:00:00 AM
  • Firstpage
    222
  • Lastpage
    226
  • Abstract
    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.
  • Keywords
    Application software; Delay effects; Delay systems; Distributed computing; Human factors; Operating systems; Problem-solving; Psychology; Springs; Time sharing computer systems;
  • fLanguage
    English
  • Journal_Title
    Systems, Man and Cybernetics, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9472
  • Type

    jour

  • DOI
    10.1109/TSMC.1976.5409242
  • Filename
    5409242
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1412447