Absorbing stochastic estimator learning algorithms with high accuracy and rapid convergence

Proceedings of IEEE/ACS International Conference on Computer Systems and Applications, AICCSA

Volumn 2001-January, Issue , 2001, Pages 45-51

  Papadimitriou, G I ^a   Pomportsis, A S ^a   Kiritsi, S ^a   Talahoupi, E ^a  

^a ARISTOTLE UNIVERSITY OF THESSALONIKI   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; LEARNING ALGORITHMS; STREAM FLOW;

HIGH-ACCURACY; LEARNING AUTOMATA; RAPID CONVERGENCE; STATIONARY ENVIRONMENTS; STOCHASTIC ESTIMATORS;

STOCHASTIC SYSTEMS;

EID: 39049129012     PISSN: 21615322     EISSN: 21615330     Source Type: Conference Proceeding    
DOI: 10.1109/AICCSA.2001.933950     Document Type: Conference Paper

References (17)

1. G.I.Papadimitriou "A New Approach to the Design of Reinforcement Schemes for Learning Automata: Stochastic Estimator Learning Algorithms" IEEE Transactions on Knowledge and Data Engineering, vol.6, no.4, August 1994.
2. K.Najim and A.S.Poznyak "Learning Automata: Theory and applications".
3. B.J.Oommen and J.K.Lanctot, "Discretized pursuit learning automata," IEEE Trans. Syst., Man, Cybernetics, vol. SMC-20, no. 4, pp.931-938,July/Aug.1990.
4. B.J.Oommen and J.P.R.Christensen. "Epsilon optimal discretized linear reward-penalty learning automata," IEEE Trans. Syst., Man, Cybernetics, vol. SMC-18, no. 3, pp. 451-458, May/June 1988.
5. S.Lakshmivarahan and M.A.L.Thathachar."Absolutely expedient learning algorithms for stochastic automata," IEEE Trans. Syst., Man, Cybernetics, vol. SMC-3, pp. 281-286. May 1973.
6. M.A.L.Thathachar and P.S.Sastry, "A class of rapidly converging algorithms for learning automata," IEEE Trans. Syst., Man, Cybernetics, vol. SMC-15, no. 1, pp. 168-175, Jan./Feb. 1985.
7. G.I.Papadimitriou, "Hierarchical discretized pursuit nonlinear learning automata with rapid convergence and high accuracy," IEEE Transactions on Knowledge and Data Engineering, vol.6, no.4, August 1994.
8. R.Viswanathan and K.S.Narendra,"Stochastic automata models with applications to learning systems,"IEEE Trans. Syst. Man, Cybernetics, vol. SMC-3, pp. 107-111, Jan. 1973.
9. R.Simha and J.F Kurose,"Relative reward strength algorithms for learning automata," IEEE Transactions on Systems, Man and Cybernetics, vol. 19, no. 1, pp. 388-398, Mar./April 1989.
10. th IEEE Conf. Local Comput. Networks, Minneapolis, MN, USA, 13-16 Sept. 1992.
11. K.S.Narendra and M.A.L.Thathachar, "Learning automata: A survey," IEEE Trans. Syst., Man, Cybernetics, vol. SMC-4 no. 4, pp. 323-334, July 1974.
12. K.S.Narendra and S.Lakshmivarahan, "Learning automata: A critique," J. Cybernetics and Inform, Sci., vol. 1, pp. 53-66, 1977.
13. O.V.Nedzelnitski and K.S.Narendra, "Nonstati-onary models of learning automata routing in data communication networks."IEEE Transactions on Systems., Man and Cybernetics, vol. SMC-17, no. 6, pp. 1004-1015, Nov./Dec. 1987.
14. K.S.Narendra and M.A.L.Thathachar, "Learning Automata: An Introduction", Prentice Hall, New Jersey, 1989.
15. G.I.Papadimitriou and D.G.Maritsas, "Learning Automata-Based Receiver Conflict Avoidance Algorithms for WDM Broadcast-and-Select Star Networks", IEEE/ACM Transactions on Networking, vol.4, no.3, June 1996.
16. G.I.Papadimitriou and A.S.Pomportsis, "Learning-Automata-Based TDMA Protocols for Broadcast Communication Systems with Bursty Traffic", IEEE Communications Letters, vol.4, no.3, March 2000.
17. G.I.Papadimitriou and A.S.Pomportsis, "Self-Adaptive TDMA Protocols for WDM Star Networks: A Learning-Automata-Based Approach", IEEE Photonics Technology Letters, vol.11, no.10, pp.1322-1324, October 1999.