Supersaturated designs with high searching probability
From MaRDI portal
Publication:2474429
DOI10.1016/J.JSPI.2007.05.006zbMath1130.62076OpenAlexW2079841570MaRDI QIDQ2474429
Angshuman Sarkar, Dennis K. J. Lin, Kashinath Chatterjee
Publication date: 6 March 2008
Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jspi.2007.05.006
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Construction of mixed-level supersaturated design
- On the identifiability of a supersaturated design.
- Searching probabilities for nonzero effects in search designs for the noisy case
- Optimal mixed-level supersaturated design
- Three-level supersaturated designs
- Construction of supersaturated designs involving \(s\)-level factors
- Construction of \(E(s^2)\)-optimal supersaturated designs
- On the construction of multi-level supersaturated designs
- An Algorithmic Approach to Constructing Supersaturated Designs
- An Analysis for Unreplicated Fractional Factorials
- Some Systematic Supersaturated Designs
- Construction of supersaturated designs through partially aliased interactions
- A method for constructing supersaturated designs and its Es2 optimality
- Supersaturated design including an orthogonal base
- Columnwise-Pairwise Algorithms with Applications to the Construction of Supersaturated Designs
- Generating Systematic Supersaturated Designs
- Characterizing projected designs: repeat and mirror-image runs
This page was built for publication: Supersaturated designs with high searching probability