论文信息 - The Use of Learning Algorithms in Telephone Traffic Routing — A Methodology - 字舞流文

The Use of Learning Algorithms in Telephone Traffic Routing — A Methodology

Kumpati S. Narendra | Philip Mars | K. Narendra | P. Mars

[1] P. R. Srikantakumar,et al. A LEARNING MODEL FOR ROUTING IN TELEPHONE NETWORKS , 1982 .

[2] R. W. Mclaren,et al. A stochastic automaton model for the synthesis of learning systems , 1966 .

[3] Hidekazu Tsuji,et al. An automaton in the nonstationary random environment , 1973, Inf. Sci..

[4] G. Langholz. Behaviour of automata in a nonstationary random environment , 1971 .

[5] Norio Baba,et al. On the Learning Behavior of Stochastic Automata Under a Nonstationary Random Environment , 1975, IEEE Transactions on Systems, Man, and Cybernetics.

[6] B. Chandrasekaran,et al. On Expediency and Convergence in Variable-Structure Automata , 1968, IEEE Trans. Syst. Sci. Cybern..

[7] Kumpati S. Narendra,et al. Application of Learning Automata to Telephone Traffic Routing and Control , 1977, IEEE Transactions on Systems, Man, and Cybernetics.

[8] S. Lakshmivarahan,et al. Optimal non-linear reinforcement schemes for stochastic automata , 1972, Inf. Sci..

[9] G. S. Kleimenova,et al. A construction of an automaton which is asymptotically optimal in a stationary random medium , 1968 .

[10] K. Narendra,et al. Analysis of memory depth in fixed structure learning automata , 1977 .

[11] M. L. Tsetlin. On the Behavior of Finite Automata in Random Media , 1961 .

[12] Kumpati S. Narendra,et al. Learning Automata - A Survey , 1974, IEEE Trans. Syst. Man Cybern..