Pages that link to "Item:Q2198200"
From MaRDI portal
The following pages link to A greedy-metaheuristic 3-stage approach to construct covering arrays (Q2198200):
Displaying 7 items.
- A two-stage algorithm for combinatorial testing (Q519759) (← links)
- In-parameter-order strategies for covering perfect hash families (Q2079142) (← links)
- A greedy algorithm to construct covering arrays using a graph representation (Q2201668) (← links)
- Covering array EXtender (Q2242769) (← links)
- Improved covering arrays using covering perfect hash families with groups of restricted entries (Q2287570) (← links)
- Construction of mixed covering arrays using a combination of simulated annealing and variable neighborhood search (Q2631238) (← links)
- Subspace restrictions and affine composition for covering perfect hash families (Q5198019) (← links)