Sciweavers

Share
IWOCA
2009
Springer

Randomized Postoptimization of Covering Arrays

8 years 10 months ago
Randomized Postoptimization of Covering Arrays
The construction of covering arrays with the fewest rows remains a challenging problem. Most computational and recursive constructions result in extensive repetition of coverage. While some is necessary, some is not. By reducing the repeated coverage, metaheuristic search techniques typically outperform simpler computational methods, but they have been applied in a limited set of cases. Time constraints often prevent them from finding an array of competitive size. We examine a different approach. Having used a simple computation or construction to find a covering array, we employ a postoptimization technique that repeatedly adjusts the array in order to (sometimes) reduce its number of rows. At every stage the array retains full coverage. We demonstrate its value on a collection of previously best known arrays by eliminating, in some cases, 10% of their rows. In the well-studied case of strength two with twenty factors having ten values each, postoptimization produces a covering arr...
Peyman Nayeri, Charles J. Colbourn, Goran Konjevod
Added 27 May 2010
Updated 27 May 2010
Type Conference
Year 2009
Where IWOCA
Authors Peyman Nayeri, Charles J. Colbourn, Goran Konjevod
Comments (0)
books