Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

20

DM
2008

favoriteEmaildiscussreport

75views more DM 2008»

Constructing strength three covering arrays with augmented annealing

13 years 11 months ago

Constructing strength three covering arrays with augmented annealing

Download cse.unl.edu

A covering array CA(N; t, k, v) is an N

Myra B. Cohen, Charles J. Colbourn, Alan C. H. Lin

Real-time Traffic

Combinatorial Constructions | Computational Search | DM 2008 | Recursive Combinatorial Constructions |

claim paper

Related Content

» Augmenting Simulated Annealing to Build Interaction Test Suites

» Memetic Algorithms for Constructing Binary Covering Arrays of Strength Three

» Simulated Annealing for constructing binary covering arrays of variable strength

» Rouxtype constructions for covering arrays of strengths three and four

» Onetestatatime heuristic search for interaction test suites

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2008
Where	DM
Authors	Myra B. Cohen, Charles J. Colbourn, Alan C. H. Ling

Comments (0)