Analysis of Stochastic Automata Algorithm for Relaxation Labeling
暂无分享,去创建一个
[1] Steven W. Zucker,et al. Continuous Relaxation and Local Maxima Selection: Conditions for Equivalence , 1979, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[2] T. Başar,et al. Dynamic Noncooperative Game Theory , 1982 .
[3] P. S. Sastry,et al. Stochastic networks for constraint satisfaction and optimization , 1990 .
[4] Steven W. Zucker,et al. On the Foundations of Relaxation Labeling Processes , 1983, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[5] Mandayam A. L. Thathachar,et al. Relaxation Labeling with Learning Automata , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[6] Kumpati S. Narendra,et al. Learning automata - an introduction , 1989 .
[7] H. Frederic Bohnenblust,et al. The Theory of Games , 1950 .
[8] Azriel Rosenfeld,et al. Cooperating Processes for Low-Level Vision: A Survey , 1981, Artif. Intell..
[9] Harold J. Kushner,et al. Approximation and Weak Convergence Methods for Random Processes , 1984 .
[10] T. Crilly,et al. The Theory of Games , 1989, The Mathematical Gazette.