Application of Learning Automata to Telephone Traffic Routing and Control
暂无分享,去创建一个
[1] M. L. Tsetlin. On the Behavior of Finite Automata in Random Media , 1961 .
[2] B. Chandrasekaran,et al. On expediency and convergence in variable structure automata , 1966 .
[3] Boehm,et al. Adaptive routing techniques for distributed communications systems , 1966 .
[4] Kumpati S. Narendra,et al. Use of Stochastic Automata for Parameter Self-Optimization with Multimodal Performance Criteria , 1969, IEEE Trans. Syst. Sci. Cybern..
[5] B. Chandrasekaran,et al. Stochastic Automata Games , 1969, IEEE Trans. Syst. Sci. Cybern..
[6] Kumpati S. Narendra,et al. A two-level system of stochastic automata for periodic random environments , 1971, CDC 1971.
[7] Gary Lee Fultz,et al. Adaptive routing techniques for message switching computer-communication networks , 1972 .
[8] Y. Flerov. Some Classes of Multi-Input Automata , 1972 .
[9] K. Narendra. Competitive and Cooperative Games of Variable-Structure Stochastic Automata , 1973 .
[10] R. L. Franks,et al. Overload model of telephone network operation , 1973 .
[11] R. L. Franks,et al. Optimum network call-carrying capacity , 1973 .
[12] Tripathi,et al. Application of learning automata to telephone traffic routing problems , 1974 .
[13] Kumpati S. Narendra,et al. Learning Automata - A Survey , 1974, IEEE Trans. Syst. Man Cybern..
[14] Daniel E. Koditschek,et al. Fixed Structure Automata in a Multi-Teacher Environment , 1977, IEEE Transactions on Systems, Man, and Cybernetics.