scientific article; zbMATH DE number 6182050

zbMath1272.68004MaRDI QIDQ5300606

Yu Lei, D. Richard Kuhn, Raghu N. Kacker

Publication date: 27 June 2013

Full work available at URL: http://proquest.tech.safaribooksonline.de/9781466552302

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (19)

On a combinatorial framework for fault characterization ⋮ A primer on the application of neural networks to covering array generation ⋮ Covering arrays, augmentation, and quilting arrays ⋮ Sliced AETG: a memory-efficient variant of the AETG covering array generation algorithm ⋮ Combinatorial sequences for disaster scenario generation ⋮ Algebraic Modelling of Covering Arrays ⋮ Weighted \(t\)-way sequences ⋮ Algebraic techniques for covering arrays and related structures ⋮ Asymptotic and constructive methods for covering perfect hash families and covering arrays ⋮ Subspace restrictions and affine composition for covering perfect hash families ⋮ Partial covering arrays: algorithms and asymptotics ⋮ Cost-efficient mixed-level covering designs for testing experiments ⋮ Arrays for combinatorial interaction testing: a review on constructive approaches ⋮ Factorials experiments, covering arrays, and combinatorial testing ⋮ Problems and algorithms for covering arrays via set covers ⋮ IPO-Q: A Quantum-Inspired Approach to the IPO Strategy Used in CA Generation ⋮ Algorithmic methods for covering arrays of higher index ⋮ Upper Bounds on the Size of Covering Arrays ⋮ Heuristically enhanced IPO algorithms for covering array generation

This page was built for publication: