𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Adaptive optimization of the Monte-Carlo method

✍ Scribed by A. N. Nakonechnyi; V. D. Shpak


Publisher
Springer US
Year
1994
Tongue
English
Weight
346 KB
Volume
30
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Adaptive random search in Quasi-Monte Ca
✍ 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

Optimizing efficiency of perturbative Mo
✍ Evans, Tom J.; Truong, Thanh N. πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 289 KB πŸ‘ 1 views

We introduce error weighting functions into the perturbative Monte Carlo method for use with a hybrid ab initio quantum Ε½ . mechanicsrmolecular mechanics QMrMM potential. The perturbative Monte Carlo approach introduced earlier provides a means to reduce the number of full SCF calculations in simula

Some adaptive Monte Carlo methods for Ba
✍ Luke Tierney; Antonietta Mira πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 91 KB πŸ‘ 2 views

Monte Carlo methods, in particular Markov chain Monte Carlo methods, have become increasingly important as a tool for practical Bayesian inference in recent years. A wide range of algorithms is available, and choosing an algorithm that will work well on a speci"c problem is challenging. It is theref