Supersaturated designs with high searching probability
From MaRDI portal
Publication:2474429
Recommendations
- Supersaturated designs: a review of their construction and analysis
- Supersaturated design including an orthogonal base
- Probability of correct model identification in supersaturated design
- Two-level supersaturated designs for 2ᵏ runs and other cases
- Supersaturated designs for one or two effective factors
Cites work
- scientific article; zbMATH DE number 3490286 (Why is no real title available?)
- scientific article; zbMATH DE number 1321833 (Why is no real title available?)
- scientific article; zbMATH DE number 1089164 (Why is no real title available?)
- A method for constructing supersaturated designs and its Es2 optimality
- An Algorithmic Approach to Constructing Supersaturated Designs
- An Analysis for Unreplicated Fractional Factorials
- Characterizing projected designs: repeat and mirror-image runs
- Columnwise-Pairwise Algorithms with Applications to the Construction of Supersaturated Designs
- Construction of \(E(s^2)\)-optimal supersaturated designs
- Construction of mixed-level supersaturated design
- Construction of supersaturated designs involving \(s\)-level factors
- Construction of supersaturated designs through partially aliased interactions
- Generating Systematic Supersaturated Designs
- On the construction of multi-level supersaturated designs
- On the identifiability of a supersaturated design.
- Optimal mixed-level supersaturated design
- Searching probabilities for nonzero effects in search designs for the noisy case
- Some Systematic Supersaturated Designs
- Supersaturated design including an orthogonal base
- Three-level supersaturated designs
Cited in
(2)
This page was built for publication: Supersaturated designs with high searching probability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2474429)