Share Email Print

Proceedings Paper

Stochastic search
Author(s): Griff L. Bilbro
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Systems that select an optimal or nearly optimal member from a specified search set are reviewed with special emphasis on stochastic approaches such as simulated annealing, genetic algorithms, as well as other probabilistic heuristics. Because of local minima, selecting a global optimum may require time that increases exponentially in the problem size. Stochastic search provides advantages in robustness, generality, and simplicity over other approaches and is more efficient than exhaustive deterministic search.

Paper Details

Date Published: 1 March 1994
PDF: 26 pages
Proc. SPIE 10277, Adaptive Computing: Mathematics, Electronics, and Optics: A Critical Review, 1027703 (1 March 1994); doi: 10.1117/12.171192
Show Author Affiliations
Griff L. Bilbro, North Carolina State Univ. (United States)

Published in SPIE Proceedings Vol. 10277:
Adaptive Computing: Mathematics, Electronics, and Optics: A Critical Review
Su-Shing Chen; H. John Caulfield, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?