Pages that link to "Item:Q5205494"
From MaRDI portal
The following pages link to Two‐stage algorithms for covering array construction (Q5205494):
Displaying 10 items.
- A two-stage algorithm for combinatorial testing (Q519759) (← links)
- A survey of methods for constructing covering arrays (Q763563) (← links)
- Merging covering arrays and compressing multiple sequence alignments (Q1026121) (← links)
- Covering arrays avoiding forbidden edges (Q1040583) (← links)
- Evaluation of tie-breaking and parameter ordering for the IPO family of algorithms used in covering array generation (Q1671001) (← links)
- Sliced AETG: a memory-efficient variant of the AETG covering array generation algorithm (Q2193001) (← links)
- A greedy-metaheuristic 3-stage approach to construct covering arrays (Q2198200) (← links)
- Upper bounds on the sizes of variable strength covering arrays using the Lovász local lemma (Q2333832) (← links)
- Upper Bounds on the Size of Covering Arrays (Q5270407) (← links)
- Combinatorial testing: using blocking to assign test cases for validating complex software systems (Q5880070) (← links)