Abstract
In chapter 5 we derived that the probability that an annealing chain has s as its current state will go asymptotically to δ(s, t), the corresponding value of the equilibrium density. Nothing was said however about how fast these probabilities will approach the equilibrium density. Yet it is necessary to know a priori when the actual density is close enough to the equilibrium density to change the value of the control parameter and to start with another chain. In this chapter we want to address that problem.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1989 Kluwer Academic Publishers
About this chapter
Cite this chapter
Otten, R.H.J.M., van Ginneken, L.P.P.P. (1989). Finite-Time Behavior of the Annealing Algorithm. In: The Annealing Algorithm. The Kluwer International Series in Engineering and Computer Science, vol 72. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-1627-5_9
Download citation
DOI: https://doi.org/10.1007/978-1-4613-1627-5_9
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4612-8899-2
Online ISBN: 978-1-4613-1627-5
eBook Packages: Springer Book Archive