scientific article
From MaRDI portal
Publication:3594048
zbMath1195.05017MaRDI QIDQ3594048
Publication date: 7 August 2007
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
DesignHeuristic searchOrthogonal arrayTransversalPerfect hash familyCovering arraysGroup-divisible designsInteraction testingQualitative independenceTransversal cover
Orthogonal arrays, Latin squares, Room squares (05B15) Combinatorial aspects of packing and covering (05B40)
Related Items
Non-uniform covering array with symmetric forbidden edge constraints ⋮ A primer on the application of neural networks to covering array generation ⋮ Automation of broad sanity test generation ⋮ Construction of mixed covering arrays using a combination of simulated annealing and variable neighborhood search ⋮ Constraint models for the covering test problem ⋮ Mixed covering arrays on graphs of small treewidth ⋮ Binary covering arrays on tournaments ⋮ Binary Covering Arrays and Existentially Closed Graphs ⋮ Covering arrays from \(m\)-sequences and character sums ⋮ Covering schemes of strength \(t\) ⋮ A construction for strength-3 covering arrays from linear feedback shift register sequences ⋮ Ordered covering arrays and upper bounds on covering codes ⋮ Constructing heterogeneous hash families by puncturing linear transversal designs ⋮ Sliced AETG: a memory-efficient variant of the AETG covering array generation algorithm ⋮ New optimal covering arrays using an orderly algorithm ⋮ Finite field constructions of combinatorial arrays ⋮ Algebraic Modelling of Covering Arrays ⋮ Optimum mixed level detecting arrays ⋮ The equivalence between optimal detecting arrays and super-simple OAs ⋮ Constructions of covering arrays of strength five ⋮ Asymptotic and constructive methods for covering perfect hash families and covering arrays ⋮ The Lovász local lemma and variable strength covering arrays ⋮ Optimum super-simple mixed covering arrays of type \(a^1 b^{k-1}\) ⋮ Partial covering arrays and a generalized Erdös-Ko-Rado property ⋮ Covering arrays from cyclotomy ⋮ Test sequence construction using minimum information on the tested system ⋮ Partial covering arrays: algorithms and asymptotics ⋮ Graph-intersecting set systems and LYM inequalities ⋮ Covering arrays of strength 3 and 4 from holey difference matrices ⋮ Linear hash families and forbidden configurations ⋮ Arrays for combinatorial interaction testing: a review on constructive approaches ⋮ A survey of methods for constructing covering arrays ⋮ Generalized covering designs and clique coverings ⋮ Factorials experiments, covering arrays, and combinatorial testing ⋮ Improving two recursive constructions for covering arrays ⋮ Covering arrays avoiding forbidden edges ⋮ Group Divisible Covering Designs with Block Size 4: A Type of Covering Array with Row Limit ⋮ Upper bounds on the sizes of variable strength covering arrays using the Lovász local lemma ⋮ Algorithmic methods for covering arrays of higher index ⋮ Upper Bounds on the Size of Covering Arrays ⋮ Optimum detecting arrays for independent interaction faults ⋮ Binary consecutive covering arrays
