The following pages link to (Q5300606):
Displaying 19 items.
- Partial covering arrays: algorithms and asymptotics (Q726106) (← links)
- On a combinatorial framework for fault characterization (Q1616211) (← links)
- Weighted \(t\)-way sequences (Q1739925) (← links)
- Algebraic techniques for covering arrays and related structures (Q1739926) (← links)
- Asymptotic and constructive methods for covering perfect hash families and covering arrays (Q1741930) (← links)
- Factorials experiments, covering arrays, and combinatorial testing (Q2071532) (← links)
- Algorithmic methods for covering arrays of higher index (Q2103319) (← links)
- Heuristically enhanced IPO algorithms for covering array generation (Q2115896) (← links)
- Sliced AETG: a memory-efficient variant of the AETG covering array generation algorithm (Q2193001) (← links)
- Cost-efficient mixed-level covering designs for testing experiments (Q2301219) (← links)
- Arrays for combinatorial interaction testing: a review on constructive approaches (Q2303506) (← links)
- Problems and algorithms for covering arrays via set covers (Q2333828) (← links)
- Covering arrays, augmentation, and quilting arrays (Q2920882) (← links)
- Algebraic Modelling of Covering Arrays (Q4610003) (← links)
- IPO-Q: A Quantum-Inspired Approach to the IPO Strategy Used in CA Generation (Q5014686) (← links)
- A primer on the application of neural networks to covering array generation (Q5043857) (← links)
- Subspace restrictions and affine composition for covering perfect hash families (Q5198019) (← links)
- Upper Bounds on the Size of Covering Arrays (Q5270407) (← links)
- Combinatorial sequences for disaster scenario generation (Q6168351) (← links)
