Abstract
A lower bound is given for the number of experimental runs required in search designs for two-level orthogonal array of strength one.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 203-204 |
| Number of pages | 2 |
| Journal | Journal of Statistical Planning and Inference |
| Volume | 74 |
| Issue number | 1 |
| State | Published - Oct 1 1998 |
All Science Journal Classification (ASJC) codes
- Statistics and Probability
- Statistics, Probability and Uncertainty
- Applied Mathematics
Fingerprint
Dive into the research topics of 'A note on Morris' bound for search designs'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver