Learning automata in feedforward connectionist systems

REFERENCES

• BARTO , A. G. , and ANANDAN , P. , 1985 , IEEE Transactions on Systems Man. and Cybernetics , 15 , 360 .
   Web of Science ®Google Scholar
• DUDA , R. O. , and HART , P. E. , 1973 , Pattern Classification and Scene Analysis ( New York Wiley ).
   Google Scholar
• KUSHNER , H. J. , 1984 , Approximation and Weak Convergence Methods for Random Processes ( Cambridge , Mass MIT Press ).
   Google Scholar
• NARENDRA , K. S. ,ANNASWAMY. A., 1989 , Slable Adaptive Systems ( Englewood Cliffs , NJ Prentice Hall ).
   Google Scholar
• NARENDRA , K. , S., and THATHACHAR , M. A. L. , 1989 , Learning Automata an Introduction ( Englewood Cliffs , NJ Prentice Hall ).
   Google Scholar
• PHANSALKAR , V. V. , 1991 , Ph.D. thesis , Indian Institute of Science , Bangalore .
   Google Scholar
• PHANSALKAR , V. V. , SASTRY , P. S. , and THATHACHAR , M. A. L. , 1994 , Proceedings of the Indian Academy of Sciences, Mathematical Science , 104 , 279 .
   Google Scholar
• THATHACHAR , M. A. L. , and PHANSALKAR , V. V. , 1995a , Neural Computation , 7 , 950 ; 1995 b, IEEE Transactions on Systems, Man and Cyberneticst, to be published .
   Google Scholar
• WILLIAMS , R. J. , 1988 , NU–CCS–88–3 , Northeastern University , Boston , Massachusetts , U.S.A .
   Google Scholar
• ZANGWILL , W. , 1969 , Nonlinear Programming a Unified Approach ( Englewood Cliffs , NJ Prentice Hall ).
   Google Scholar