Year-end Sale % OFF 
Abstract
The efficiency of a continuous version of the simulated annealing algorithm is evaluated by the expected number of steps to reach an ϵ-neighborhood of the global minimum value of the objective function. Different sampling procedures are analyzed and compared to the pure random search procedure. And as a side result, we obtain simpler proofs for some asymptotic results of Dekkers and Aarts (1991).
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
