Pages that link to "Item:Q953845"

The following pages link to Tabu search for covering arrays using permutation vectors (Q953845):

Displaying 19 items.

• An algorithmic construction of \(E(s^2)\)-optimal supersaturated designs (Q452516) (← links)
• A two-stage algorithm for combinatorial testing (Q519759) (← links)
• Covering and radius-covering arrays: constructions and classification (Q708354) (← links)
• Asymptotic and constructive methods for covering perfect hash families and covering arrays (Q1741930) (← links)
• Randomized post-optimization of covering arrays (Q1761502) (← links)
• Covering arrays of strength three from extended permutation vectors (Q1791674) (← links)
• In-parameter-order strategies for covering perfect hash families (Q2079142) (← links)
• A greedy-metaheuristic 3-stage approach to construct covering arrays (Q2198200) (← links)
• Covering array EXtender (Q2242769) (← links)
• Improved covering arrays using covering perfect hash families with groups of restricted entries (Q2287570) (← links)
• Arrays for combinatorial interaction testing: a review on constructive approaches (Q2303506) (← links)
• Locating and detecting arrays for interaction faults (Q2426663) (← links)
• MiTS in Depth: An Analysis of Distinct Tabu Search Configurations for Constructing Mixed Covering Arrays (Q2866118) (← links)
• Covering arrays, augmentation, and quilting arrays (Q2920882) (← links)
• CONSTRUCTION OF MIXED COVERING ARRAYS OF STRENGTHS 2 THROUGH 6 USING A TABU SEARCH APPROACH (Q3166745) (← links)
• Subspace restrictions and affine composition for covering perfect hash families (Q5198019) (← links)
• Upper Bounds on the Size of Covering Arrays (Q5270407) (← links)
• Binary Covering Arrays and Existentially Closed Graphs (Q5322995) (← links)
• An extension of a construction of covering arrays (Q6188123) (← links)