๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Pure adaptive search in monte carlo optimization

โœ Scribed by Nitin R. Patel; Robert L. Smith; Zelda B. Zabinsky

Publisher
Springer-Verlag
Year
1989
Tongue
English
Weight
554 KB
Volume
43
Category
Article
ISSN
0025-5610

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Adaptive random search in Quasi-Monte Ca
Adaptive random search in Quasi-Monte Carlo methods for global optimization
โœ Guiyuan Lei ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 569 KB

## Quasi-Monte Carlo random search is useful in nondifferentiable optimization. Borrowing ideas of population evolution from genetic algorithms, we introduce an adaptive random search in quasi-Monte Carlo methods (AQMC) for global optimization. Adaptive technique is used such that local search can

Monte Carlo tree search in Kriegspiel
Monte Carlo tree search in Kriegspiel
โœ Paolo Ciancarini; Gian Piero Favini ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 741 KB
A Feedback Algorithm for Determining Sea
A Feedback Algorithm for Determining Search Parameters for Monte Carlo Optimization
โœ Chris Morey; John Scales; Erik S. Van Vleck ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 242 KB

Monte Carlo methods have become popular for obtaining solutions to global optimization problems. One such Monte Carlo optimization technique is simulated annealing (SA). Typically in SA the parameters of the search are determined a priori. Using an aggregated, or lumped, version of SA's associated M