Logarithmic convergence of random heuristic search

Michael D. Vose

doi:10.1117/12.179239

30 June 1994 Logarithmic convergence of random heuristic search

Michael D. Vose

Proceedings Volume 2304, Neural and Stochastic Methods in Image and Signal Processing III; (1994) https://doi.org/10.1117/12.179239
Event: SPIE's 1994 International Symposium on Optics, Imaging, and Instrumentation, 1994, San Diego, CA, United States

Abstract

A general class of stochastic search algorithms, random heuristic search, is reviewed. A general convergence theorem for this class is proved. Since the simple genetic algorithm is an instance of random heuristic search, a corollary is a result concerning GAs and logarithmic time to convergence.

Citation Download Citation

Michael D. Vose "Logarithmic convergence of random heuristic search", Proc. SPIE 2304, Neural and Stochastic Methods in Image and Signal Processing III, (30 June 1994); https://doi.org/10.1117/12.179239

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available