论文信息 - IV. Mean Field Approximation for Parallel Computation - 字舞流文

IV. Mean Field Approximation for Parallel Computation

Fei Qian | Hironori Hirata | H. Hirata | Fei Qian

[1] David E. van den Bout,et al. Graph partitioning using annealed neural networks , 1990, International 1989 Joint Conference on Neural Networks.

[2] Carsten Peterson,et al. Neural Networks and NP-complete Optimization Problems; A Performance Study on the Graph Bisection Problem , 1988, Complex Syst..

[3] J. Hopfield,et al. Computing with neural circuits: a model. , 1986, Science.

[4] B. Gidas. Nonstationary Markov chains and convergence of the annealing algorithm , 1985 .

[5] Donald Geman,et al. Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[6] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.

[7] J J Hopfield,et al. Neural networks and physical systems with emergent collective computational abilities. , 1982, Proceedings of the National Academy of Sciences of the United States of America.

[8] Rick Durrett,et al. An introduction to infinite particle systems , 1981 .

[9] Brian W. Kernighan,et al. An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

[10] Laurent Hérault,et al. Neural Networks and Graph K-Partitioning , 1989, Complex Syst..

[11] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .