Share Email Print
cover

Proceedings Paper

Logarithmic convergence of random heuristic search
Author(s): Michael D. Vose
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper 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.

Paper Details

Date Published: 30 June 1994
PDF: 7 pages
Proc. SPIE 2304, Neural and Stochastic Methods in Image and Signal Processing III, (30 June 1994); doi: 10.1117/12.179239
Show Author Affiliations
Michael D. Vose, Univ. of Tennessee/Knoxville (United States)


Published in SPIE Proceedings Vol. 2304:
Neural and Stochastic Methods in Image and Signal Processing III
Su-Shing Chen, Editor(s)

© SPIE. Terms of Use
Back to Top