Pages that link to "Item:Q1761502"
From MaRDI portal
The following pages link to Randomized post-optimization of covering arrays (Q1761502):
Displaying 14 items.
- Augmentation of covering arrays of strength two (Q897271) (← links)
- On a combinatorial framework for fault characterization (Q1616211) (← links)
- Improved strength four covering arrays with three symbols (Q1706436) (← links)
- Asymptotic and constructive methods for covering perfect hash families and covering arrays (Q1741930) (← links)
- Mixed optimization combinatorial method for constructing covering arrays (Q2017763) (← links)
- Sliced AETG: a memory-efficient variant of the AETG covering array generation algorithm (Q2193001) (← links)
- Covering array EXtender (Q2242769) (← links)
- A survey on the problems and algorithms for covering arrays via set covers (Q2333829) (← links)
- Covering arrays, augmentation, and quilting arrays (Q2920882) (← links)
- Sequence Covering Arrays and Linear Extensions (Q2946063) (← links)
- Generating covering arrays using ant colony optimization: exploration and mining (Q2951194) (← links)
- Randomized Post-optimization for t-Restrictions (Q4915260) (← links)
- Subspace restrictions and affine composition for covering perfect hash families (Q5198019) (← links)
- On uniform covering, adaptive random search and raspberries (Q5927659) (← links)