✦ LIBER ✦

A note on Morris’ bound for search designs

✍ Scribed by Lih-Yuan Deng; Dennis K.J Lin

Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 43 KB
Volume: 74
Category: Article
ISSN: 0378-3758
DOI: 10.1016/s0378-3758(98)00099-8

No coin nor oath required. For personal study only.

✦ Synopsis

A lower bound is given for the number of experimental runs required in search designs for two-level orthogonal array of strength one.

📜 SIMILAR VOLUMES

A note on lower bound of centeredL2-disc

A note on lower bound of centeredL2-discrepancy on combined designs

✍ Yi Ju Lei; Zu Jun Ou; Hong Qin; Na Zou 📂 Article 📅 2011 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 265 KB

Search for a bound state

✍ N.V. Shevchenko; J. Mareš; A. Gal 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 174 KB

A note on robust designs for polynomial

A note on robust designs for polynomial regression

✍ Holger Dette 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 557 KB

A note on 3-blocked designs

✍ Luigia Berardi 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 145 KB 👁 2 views

A blocking set of a design different from a 2-(λ+ 2, λ+ 1, λ) design has at least 3 points. The aim of this note is to establish which 2-(v, k, λ ) designs D with r ≥ 2λ may contain a blocking 3-set. The main results are the following. If D contains a blocking 3-set, then D is one of the following d

A note on strongly equineighboured desig

A note on strongly equineighboured designs

✍ Deborah J. Street 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 363 KB

A note on variance balanced designs

✍ C.G. Khatri 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 456 KB