✦ LIBER ✦

General Upper Bounds on the Runtime of Parallel Evolutionary Algorithms*

✍ Scribed by Lässig, Jörg; Sudholt, Dirk

Book ID: 125854448
Publisher: MIT Press
Year: 2014
Tongue: English
Weight: 695 KB
Volume: 22
Category: Article
ISSN: 1063-6560
DOI: 10.1162/EVCO_a_00114

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An upper bound for the speedup of parall

An upper bound for the speedup of parallel best-bound branch-and-bound algorithms

✍ Michael J. Quinn; Narsingh Deo 📂 Article 📅 1986 🏛 Springer Netherlands 🌐 English ⚖ 586 KB

An Upper Bound for the Synthesis of Gene

An Upper Bound for the Synthesis of Generalized Parallel Counters

✍ Dormido, S.; Canto, M.A. 📂 Article 📅 1982 🏛 IEEE 🌐 English ⚖ 482 KB

General Upper Bounds on the Minimum Size

General Upper Bounds on the Minimum Size of Covering Designs

✍ Iliya Bluskov; Katherine Heinrich 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 105 KB

Let D be a finite family of k-subsets (called blocks) of a v-set X(v). Then D is a (v, k, t) covering design or covering if every t-subset of X(v) is contained in at least one block of D. The number of blocks is the size of the covering, and the minimum size of the covering is called the covering nu

Automated proofs of upper bounds on the

Automated proofs of upper bounds on the running time of splitting algorithms

✍ S. S. Fedin; A. S. Kulikov 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 391 KB

[IEEE 2013 IEEE Congress on Evolutionary

[IEEE 2013 IEEE Congress on Evolutionary Computation (CEC) - Cancun, Mexico (2013.06.20-2013.06.23)] 2013 IEEE Congress on Evolutionary Computation - Lower bounds for the runtime of a global multi-objective evolutionary algorithm

✍ Doerr, Benjamin; Kodric, Bojana; Voigt, Marco 📂 Article 📅 2013 🏛 IEEE ⚖ 865 KB

Almost linear upper bounds on the length

Almost linear upper bounds on the length of general davenport—schinzel sequences

✍ Micha Sharir 📂 Article 📅 1987 🏛 Springer-Verlag 🌐 English ⚖ 604 KB