Convergence and finite-time behavior of simulated annealing
暂无分享,去创建一个
[1] N. Metropolis,et al. Equation of State Calculations by Fast Computing Machines , 1953, Resonance.
[2] R. Dobrushin. Central Limit Theorem for Nonstationary Markov Chains. II , 1956 .
[3] Dean Isaacson,et al. Strongly Ergodic Behavior for Non-Stationary Markov Processes , 1973 .
[4] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[5] K. Binder. Monte Carlo methods in statistical physics , 1979 .
[6] Jacob T. Schwartz,et al. Fast Probabilistic Algorithms for Verification of Polynomial Identities , 1980, J. ACM.
[7] P. Moran,et al. Reversibility and Stochastic Networks , 1980 .
[8] Scott Kirkpatrick,et al. Global Wiring by Simulated Annealing , 1983, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.
[9] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[10] Donald Geman,et al. Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[11] A. Sangiovanni-Vincentelli,et al. The TimberWolf placement and routing package , 1985, IEEE Journal of Solid-State Circuits.
[12] B. Gidas. Nonstationary Markov chains and convergence of the annealing algorithm , 1985 .
[13] Alistair I. Mees,et al. Convergence of an annealing algorithm , 1986, Math. Program..