On a combinatorial framework for fault characterization (Q1616211): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: PDCO / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11786-018-0385-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2890851189 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3503433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2866562 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact learning of juntas from membership queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Atomic Decomposition by Basis Pursuit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds on the number of columns in supersaturated designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5241120 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint Spread Systems and Fault Location / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic and constructive methods for covering perfect hash families and covering arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locating and detecting arrays for interaction faults / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive versus nonadaptive attribute-efficient learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uncertainty principles and ideal atomic decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4506360 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4074927 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic Size of Covering Arrays: An Application of Entropy Compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>t</i>-Covering Arrays: Upper Bounds and Poisson Approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3374252 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Problems and algorithms for covering arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Supersaturated Designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5300606 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sperner Partition Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the ratio of optimal integral and fractional covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locating Errors Using ELAs, Covering Arrays, and Adaptive Testing Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Sperner-type theorem for set-partition systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constructive proof of the general lovász local lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized post-optimization of covering arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of combinatorial testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper Bounds on the Size of Covering Arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separating interaction effects using locating and detecting arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal locating arrays for at most two faults / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two combinatorial covering theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimality and constructions of locating arrays / rank
 
Normal rank

Revision as of 04:07, 17 July 2024

scientific article
Language Label Description Also known as
English
On a combinatorial framework for fault characterization
scientific article

    Statements

    On a combinatorial framework for fault characterization (English)
    0 references
    0 references
    0 references
    1 November 2018
    0 references
    covering array
    0 references
    combinatorial testing
    0 references
    locating array
    0 references
    detecting array
    0 references
    compressive sensing
    0 references
    experimental design
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references