A survey of methods for constructing covering arrays
From MaRDI portal
Publication:763563
DOI10.1134/S0361768811030029zbMATH Open1242.68069MaRDI QIDQ763563FDOQ763563
A. A. Petukhov, V. V. Kuliamin
Publication date: 12 March 2012
Published in: Programming and Computer Software (Search for Journal in Brave)
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Nonnumerical algorithms (68W05) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Introduction to algorithms
- Strength two covering arrays: existence tables and projection
- Products of mixed covering arrays of strength two
- Problems and algorithms for covering arrays
- t-Covering Arrays: Upper Bounds and Poisson Approximations
- Covering arrays and intersecting codes
- New optimization heuristics. The great deluge algorithm and the record- to-record travel
- Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
- On \(t\)-covering arrays
- On the state of strength-three covering arrays
- Covering and radius-covering arrays: constructions and classification
- Roux-type constructions for covering arrays of strengths three and four
- Constructing strength three covering arrays with augmented annealing
- Upper bounds for covering arrays by tabu search.
- Vector sets for exhaustive testing of logic circuits
- Group construction of covering arrays
- Constructions of difference covering arrays.
- Randomized Postoptimization of Covering Arrays
- The Mathematics of the Pentium Division Bug
Cited In (18)
- Title not available (Why is that?)
- A construction of variable strength covering arrays
- Algorithmic methods for covering arrays of higher index
- Attribute-efficient learning of Boolean functions from Post closed classes
- A survey of binary covering arrays
- Mixed optimization combinatorial method for constructing covering arrays
- MiTS in Depth: An Analysis of Distinct Tabu Search Configurations for Constructing Mixed Covering Arrays
- CONSTRUCTION OF MIXED COVERING ARRAYS OF STRENGTHS 2 THROUGH 6 USING A TABU SEARCH APPROACH
- Mixed-level covering, locating, and detecting arrays via cyclotomy
- Problems and algorithms for covering arrays via set covers
- A survey on the problems and algorithms for covering arrays via set covers
- Constructing new covering arrays from LFSR sequences over finite fields
- Detecting arrays for effects of multiple interacting factors
- Perfect sets of paths in the full graph of SDN switches
- Sliced AETG: a memory-efficient variant of the AETG covering array generation algorithm
- A greedy-metaheuristic 3-stage approach to construct covering arrays
- A greedy algorithm to construct covering arrays using a graph representation
- Improved covering arrays using covering perfect hash families with groups of restricted entries
Uses Software
This page was built for publication: A survey of methods for constructing covering arrays
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q763563)
