Record Details

Finite-time behavior of slowly cooled annealing chains

DSpace at IIT Bombay

View Archive Info
 
 
Field Value
 
Title Finite-time behavior of slowly cooled annealing chains
 
Creator DESAI, MP
RAO, VB
 
Subject markov-chains
convergence
algorithm
 
Description We present results on the finite-time behavior of the discrete-time, finite-space version of the simulated annealing algorithm. The asymptotic and finite-time behavior of the annealing algorithm under slow cooling will be shown to depend on the largest eigenvalue of a certain matrix. To illustrate the utility of our results, we study the slowly cooled annealing algorithm applied to the maximum matching problem and demonstrate a polynomial randomized approximation property of the algorithm.
 
Publisher CAMBRIDGE UNIV PRESS
 
Date 2011-07-19T10:09:49Z
2011-12-26T12:51:08Z
2011-12-27T05:37:34Z
2011-07-19T10:09:49Z
2011-12-26T12:51:08Z
2011-12-27T05:37:34Z
1997
 
Type Article
 
Identifier PROBABILITY IN THE ENGINEERING AND INFORMATIONAL SCIENCES, 11(2), 137-176
0269-9648
http://dspace.library.iitb.ac.in/xmlui/handle/10054/5259
http://hdl.handle.net/10054/5259
 
Language en