✦ LIBER ✦

A dynamic selection algorithm for globally optimal subsets

✍ Scribed by Bin Yu; Baozong Yuan

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 419 KB
Volume: 5
Category: Article
ISSN: 0952-1976
DOI: 10.1016/0952-1976(92)90018-f

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A multi dynamics algorithm for global op

A multi dynamics algorithm for global optimization

✍ J.A. Hernández; J.D. Ospina 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 532 KB

Subset simulation for unconstrained glob

Subset simulation for unconstrained global optimization

✍ Hong-Shuang Li 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 490 KB

Randomized optimal algorithm for slope s

Randomized optimal algorithm for slope selection

✍ Jiří Matoušek 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 689 KB

Dynamic tunneling algorithm and simulatt

Dynamic tunneling algorithm and simulatted annealing circuit for global optimization

✍ Y. Yao 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 83 KB

Dynamic algorithm selection for runtime

Dynamic algorithm selection for runtime concepts

✍ Peter Pirkelbauer; Sean Parent; Mat Marcus; Bjarne Stroustrup 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 473 KB

A key benefit of generic programming is its support for producing modules with clean separation. In particular, generic algorithms are written to work with a wide variety of types without requiring modifications to them. The Runtime concept idiom extends this support by allowing unmodified concrete

A fast annealing evolutionary algorithm

A fast annealing evolutionary algorithm for global optimization

✍ Wensheng Cai; Xueguang Shao 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 136 KB

## Abstract By combining the aspect of population in genetic algorithms (GAs) and the simulated annealing algorithm (SAA), a novel algorithm, called fast annealing evolutionary algorithm (FAEA), is proposed. The algorithm is similar to the annealing evolutionary algorithm (AEA), and a very fast ann