✦ LIBER ✦

On the convergence of genetic algorithms – a variational approach

✍ Scribed by Wilhelm Stannat

Book ID: 106137561
Publisher: Springer
Year: 2004
Tongue: English
Weight: 163 KB
Volume: 129
Category: Article
ISSN: 1432-2064
DOI: 10.1007/s00440-003-0330-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A study on the convergence of genetic al

A study on the convergence of genetic algorithms

✍ B.M. Kim; Y.B. Kim; C.H. Oh 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 443 KB

This paper extends genetic algorithms to achieve fast solutions to difficult problem. To accomplish this, we present empirical results on the terminated condition by bias and the functionized model of mutation rate in genetic algerithms. The terminated condition by bias enable to reducing computati

Convergence of genetic algorithms

✍ R. R. Sharapov; A. V. Lapshin 📂 Article 📅 2006 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 182 KB

On the convergence rates of genetic algo

On the convergence rates of genetic algorithms

✍ Jun He; Lishan Kang 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 117 KB

The new DFM approach based on a genetic

The new DFM approach based on a genetic algorithm

✍ Masaya Yoshikawa; Hidekazu Terai 📂 Article 📅 2007 🏛 Springer Japan 🌐 English ⚖ 858 KB

Techniques for bounding the convergence

Techniques for bounding the convergence rate of genetic algorithms

✍ Yuri Rabinovich; Avi Wigderson 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 308 KB 👁 2 views

The main purpose of the present paper is the study of computational aspects, ## Ž . and primarily the convergence rate, of genetic algorithms GAs . Despite the fact that such algorithms are widely used in practice, little is known so far about their theoretical properties, and in particular about

On the Convergence of Descent Algorithms

✍ Jean-Paul Penot 📂 Article 📅 2002 🏛 Springer US 🌐 English ⚖ 70 KB