Combinatorial aspects of covering arrays

Combinatorial aspects of covering arrays

Covering arrays generalize orthogonal arrays by requiring that <em>t</em> -tuples be covered, but not requiring that the appearance of <em>t</em> -tuples be balanced.<br />Their uses in screening experiments has found application in software testing, hardware testing, a...

Full description

Bibliographic Details
Main Author: Charles J. Colbourn
Format: Article
Language:English
Published: Università degli Studi di Catania 2004-11-01
Series:Le Matematiche
Subjects:
Covering array
Qualitative independence
transversal cover
Orthogonal array
Transversal design
Perfect hash family
Interaction testing
Group-divisible designs
Heuristic search
Greedy algorithm
Online Access:http://www.dmi.unict.it/ojs/index.php/lematematiche/article/view/166

Internet

http://www.dmi.unict.it/ojs/index.php/lematematiche/article/view/166

Similar Items