AETG

swMATH9715MaRDI QIDQ21694FDOQ21694

Author name not available (Why is that?)

Cited In (66)

• Mutually unbiased maximally entangled bases from difference matrices
• Title not available (Why is that?)
• Mixed covering arrays on graphs of small treewidth
• Computational Science – ICCS 2005
• A primer on the application of neural networks to covering array generation
• Faulty Interaction Identification via Constraint Solving and Optimization
• Fault Detection and Localization Using Modelica and Abductive Reasoning
• Model Based Testing for Agent Systems
• On (\(g\), 4; 1)-difference matrices
• Constructions of difference covering arrays.
• Construction of Mixed Covering Arrays of Variable Strength Using a Tabu Search Approach
• Covering arrays on product graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Algorithmic methods for covering arrays of higher index
• Attribute-efficient learning of Boolean functions from Post closed classes
• Products of mixed covering arrays of strength two
• A new method for constructing pair-wise covering designs for software testing
• An efficient design and implementation of the in-parameter-order algorithm
• Binary Covering Arrays and Existentially Closed Graphs
• Constructing heterogeneous hash families by puncturing linear transversal designs
• Automation of broad sanity test generation
• Recent Advances in Constraints
• Heuristically enhanced IPO algorithms for covering array generation
• A survey of methods for constructing covering arrays
• Asymptotic and constructive methods for covering perfect hash families and covering arrays
• Constructions of new orthogonal arrays and covering arrays of strength three
• Roux-type constructions for covering arrays of strengths three and four
• Constructing strength three covering arrays with augmented annealing
• Linear hash families and forbidden configurations
• Merging covering arrays and compressing multiple sequence alignments
• Mixed optimization combinatorial method for constructing covering arrays
• Covering arrays via set covers
• Difference covering arrays and pseudo-orthogonal Latin squares
• Improving two recursive constructions for covering arrays
• Title not available (Why is that?)
• Classification of orthogonal arrays by integer programming
• Problems and algorithms for covering arrays
• A Logic-Based Approach to Combinatorial Testing with Constraints
• Structures and lower bounds for binary covering arrays
• New techniques for designing qualitatively independent systems
• Problems and algorithms for covering arrays via set covers
• Title not available (Why is that?)
• A formal logic approach to constrained combinatorial testing
• Strength two covering arrays: existence tables and projection
• Tabu search for covering arrays using permutation vectors
• A survey on the problems and algorithms for covering arrays via set covers
• Constraint models for the covering test problem
• The test suite generation problem: optimal instances and their implications
• Mixed covering arrays on 3-uniform hypergraphs
• Tabu search for the cyclic bandwidth problem
• Cover starters for covering arrays of strength two
• Upper bounds for covering arrays by tabu search.
• On the state of strength-three covering arrays
• Algebraic Modelling of Covering Arrays
• Randomized post-optimization of covering arrays
• Pattern matching with don't cares and few errors
• Covering arrays of strength 3 and 4 from holey difference matrices
• Factorials experiments, covering arrays, and combinatorial testing
• An adaptive algorithm for group testing for complexes
• Cost-efficient mixed-level covering designs for testing experiments
• Improved strength four covering arrays with three symbols
• Sliced AETG: a memory-efficient variant of the AETG covering array generation algorithm
• A greedy algorithm to construct covering arrays using a graph representation
• Mixed covering arrays of strength three with few factors
• On a combinatorial framework for fault characterization

This page was built for software: AETG