A survey of methods for constructing covering arrays
From MaRDI portal
(Redirected from Publication:763563)
Recommendations
Cites work
- scientific article; zbMATH DE number 3882549 (Why is no real title available?)
- scientific article; zbMATH DE number 5177325 (Why is no real title available?)
- scientific article; zbMATH DE number 2188416 (Why is no real title available?)
- t-Covering Arrays: Upper Bounds and Poisson Approximations
- Constructing strength three covering arrays with augmented annealing
- Constructions of difference covering arrays.
- Covering and radius-covering arrays: constructions and classification
- Covering arrays and intersecting codes
- Group construction of covering arrays
- Introduction to algorithms
- New optimization heuristics. The great deluge algorithm and the record- to-record travel
- On t-covering arrays
- On the state of strength-three covering arrays
- Problems and algorithms for covering arrays
- Products of mixed covering arrays of strength two
- Randomized postoptimization of covering arrays
- Roux-type constructions for covering arrays of strengths three and four
- Software and hardware testing using combinatorial covering suites
- Strength two covering arrays: existence tables and projection
- The Mathematics of the Pentium Division Bug
- Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
- Upper bounds for covering arrays by tabu search.
- Vector sets for exhaustive testing of logic circuits
Cited in
(23)- scientific article; zbMATH DE number 5177325 (Why is no real title available?)
- 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
- An efficient design and implementation of the in-parameter-order algorithm
- Generating covering arrays using ant colony optimization: exploration and mining
- Mixed optimization combinatorial method for constructing covering arrays
- Covering arrays: using prior information for construction, evaluation and to facilitate fault localization
- 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
- Problems and algorithms for covering arrays via set covers
- Mixed-level covering, locating, and detecting arrays via cyclotomy
- A survey on the problems and algorithms for covering arrays via set covers
- Constructing new covering arrays from LFSR sequences over finite fields
- Evaluation of tie-breaking and parameter ordering for the IPO family of algorithms used in covering array generation
- Detecting arrays for effects of multiple interacting factors
- Perfect sets of paths in the full graph of SDN switches
- Two-stage algorithms for covering array construction
- 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
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)
