Constructing strength three covering arrays with augmented annealing
From MaRDI portal
Publication:924952
DOI10.1016/j.disc.2006.06.036zbMath1149.05012OpenAlexW1978203195MaRDI QIDQ924952
Charles J. Colbourn, Alan C. H. Ling, Myra B. Cohen
Publication date: 29 May 2008
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2006.06.036
simulated annealingcombinatorial designorthogonal arrayheuristic searchsoftware testingcovering arraygeneralized Hadamard matrix
Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Combinatorial aspects of packing and covering (05B40)
Related Items (24)
A primer on the application of neural networks to covering array generation ⋮ Covering arrays, augmentation, and quilting arrays ⋮ Binary Covering Arrays and Existentially Closed Graphs ⋮ Unnamed Item ⋮ A construction for strength-3 covering arrays from linear feedback shift register sequences ⋮ Sliced AETG: a memory-efficient variant of the AETG covering array generation algorithm ⋮ Constructing new covering arrays from LFSR sequences over finite fields ⋮ Asymptotic and constructive methods for covering perfect hash families and covering arrays ⋮ Covering array EXtender ⋮ Tabu search for covering arrays using permutation vectors ⋮ A two-stage algorithm for combinatorial testing ⋮ Classification of orthogonal arrays by integer programming ⋮ Randomized post-optimization of covering arrays ⋮ Covering arrays from cyclotomy ⋮ Unnamed Item ⋮ Subspace restrictions and affine composition for covering perfect hash families ⋮ Improved covering arrays using covering perfect hash families with groups of restricted entries ⋮ Merging covering arrays and compressing multiple sequence alignments ⋮ A survey of methods for constructing covering arrays ⋮ Resolvable covering arrays ⋮ Improving two recursive constructions for covering arrays ⋮ In-parameter-order strategies for covering perfect hash families ⋮ Bounds for covering codes over large alphabets ⋮ Upper Bounds on the Size of Covering Arrays
Uses Software
Cites Work
- Lower bounds for transversal covers
- Orthogonal arrays. Theory and applications
- Covering arrays of strength three
- On \(t\)-covering arrays
- On the state of strength-three covering arrays
- New techniques for designing qualitatively independent systems
- Covering arrays and intersecting codes
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Constructing strength three covering arrays with augmented annealing
