Author:
Gelenbe Erol,Lent Ricardo,Xu Zhiguang
Reference22 articles.
1. E. Gelenbe “Probabilistic automata with structural restrictions”, SWAT 1969 (IEEE Symp. on Switching and Automata Theory), also appeared as On languages defined by linear probabilistic automata, Information and Control, Vol. 18, February 1971.
2. E. Gelenbe A realizable model for stochastic sequential machines, IEEE Trans. Computers, Vol. C-20, No. 2, pp. 199–204, February 1971.
3. R. Viswanathan and K.S. Narendra Comparison of expedient and optimal reinforcement schemes for learning systems, J. Cybernetics, Vol. 2, pp 21–37, 1972.
4. K.S. Narendra and P. Mars, The use of learning algorithms in telephone traffic routing - a methodology, Automatica, Vol. 19, pp. 495–502, 1983.
5. R.S. Sutton “Learning to predict the methods of temporal difference”, Machine Learning, Vol. 3, pp. 9–44, 1988.
Cited by
29 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献