✦ LIBER ✦

Good permutations for extreme discrepancy

✍ Scribed by Henri Faure

Book ID: 103219469
Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 442 KB
Volume: 42
Category: Article
ISSN: 0022-314X
DOI: 10.1016/0022-314x(92)90107-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Good Synchronization Sequences for Permu

Good Synchronization Sequences for Permutation Codes

✍ Shongwe, T.; Swart, T.G.; Ferreira, H.C.; Tran van Trung 📂 Article 📅 2012 🏛 IEEE 🌐 English ⚖ 169 KB

Potential and Discrepancy Estimates for

Potential and Discrepancy Estimates for Weighted Extremal Points

✍ M. Götz; E. B. Saff 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 105 KB

The law of the iterated logarithm for th

The law of the iterated logarithm for the discrepancies of a permutation of {nkx}

✍ K. Fukuyama 📂 Article 📅 2008 🏛 Akadmiai Kiad 🌐 English ⚖ 359 KB

Goodness-of-Fit Test for Extreme-Value D

Goodness-of-Fit Test for Extreme-Value Distribution

✍ Tsujitani, Masaaki; Ohta, Hiroshi; Kase, Shigeo 📂 Article 📅 1980 🏛 IEEE 🌐 English ⚖ 480 KB

How to keep good schemata using cross-ov

How to keep good schemata using cross-over operators for permutation problems

✍ L. Djerid; M-C. Portmann 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 292 KB

How to keep good schemata using cross-ov

How to keep good schemata using cross-over operators for permutation problems

✍ Lamia Djerid; Marie-Claude Portmann 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 296 KB

The schemata theory proposed by Holland in 1975 for the genetic algorithm approach is based on a binary representation of the problem solutions. When the description of the solution needs some more complex representation (called generally symbolic representation) and when the one-point classical cro