scientific article; zbMATH DE number 7376770
From MaRDI portal
Publication:5004048
zbMath1470.62121MaRDI QIDQ5004048
Boxin Tang, Ching-Shui Cheng, Yuanzhen He
Publication date: 30 July 2021
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (3)
Construction of group strong orthogonal arrays of strength two plus ⋮ Using nonregular designs to generate space-filling designs ⋮ A study of orthogonal array-based designs under a broad class of space-filling criteria
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Recent developments in nonregular fractional factorial designs
- Orthogonal arrays. Theory and applications
- \(2^{n-m}\) designs with resolution III or IV containing clear two-factor interactions
- The design and analysis of computer experiments.
- Strong orthogonal arrays of strength two plus
- A counterexample to Beder's conjectures about Hadamard matrices
- Minimal 1-saturating sets and complete caps in binary projective spaces.
- Doubling and projection: A method of constructing two-level designs of resolution IV
- A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code
- 1-Saturating Sets, Caps, and Doubling-Critical Sets in Binary Spaces
- Bounds on the maximum number of clear two-factor interactions for 2m-pdesigns of resolution III and IV
- Linear codes with covering radius 2 and other new covering codes
- Column-orthogonal strong orthogonal arrays and sliced strong orthogonal arrays
- Complete enumeration of pure-level and mixed-level orthogonal arrays
- Orthogonal Array-Based Latin Hypercubes
- Irregular Fractions of the 2 n Factorial Experiments
- Strong orthogonal arrays and associated Latin hypercubes for computer experiments
- Orthogonal arrays robust to nonnegligible two-factor interactions
This page was built for publication:
