On a combinatorial framework for fault characterization
From MaRDI portal
Publication:1616211
DOI10.1007/s11786-018-0385-xzbMath1433.68268OpenAlexW2890851189WikidataQ129211340 ScholiaQ129211340MaRDI QIDQ1616211
Violet R. Syrotiuk, Charles J. Colbourn
Publication date: 1 November 2018
Published in: Mathematics in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11786-018-0385-x
compressive sensingexperimental designcovering arraydetecting arraycombinatorial testinglocating array
Optimal statistical designs (62K05) Combinatorics in computer science (68R05) Orthogonal arrays, Latin squares, Room squares (05B15) Combinatorial aspects of packing and covering (05B40)
Related Items
Detecting arrays for effects of single factors ⋮ Arrays for combinatorial interaction testing: a review on constructive approaches ⋮ Algorithmic methods for covering arrays of higher index
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal locating arrays for at most two faults
- Approximation algorithms for combinatorial problems
- On the ratio of optimal integral and fractional covers
- Adaptive versus nonadaptive attribute-efficient learning
- Exact learning of juntas from membership queries
- Separating interaction effects using locating and detecting arrays
- Asymptotic and constructive methods for covering perfect hash families and covering arrays
- Randomized post-optimization of covering arrays
- Two combinatorial covering theorems
- Problems and algorithms for covering arrays
- Optimality and constructions of locating arrays
- Locating and detecting arrays for interaction faults
- A Sperner-type theorem for set-partition systems
- Upper bounds on the number of columns in supersaturated designs
- Disjoint Spread Systems and Fault Location
- Sperner Partition Systems
- A survey of combinatorial testing
- Locating Errors Using ELAs, Covering Arrays, and Adaptive Testing Algorithms
- A constructive proof of the general lovász local lemma
- Atomic Decomposition by Basis Pursuit
- Uncertainty principles and ideal atomic decomposition
- t-Covering Arrays: Upper Bounds and Poisson Approximations
- Optimal Supersaturated Designs
- Upper Bounds on the Size of Covering Arrays
- Asymptotic Size of Covering Arrays: An Application of Entropy Compression
- Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making
