scientific article
From MaRDI portal
Publication:3374252
zbMath1089.68023MaRDI QIDQ3374252
Publication date: 9 March 2006
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Reliability, testing and fault tolerance of networks and computer systems (68M15) Theory of software (68N99)
Related Items (46)
Non-uniform covering array with symmetric forbidden edge constraints ⋮ On a combinatorial framework for fault characterization ⋮ Problems and algorithms for covering arrays ⋮ Construction of non-isomorphic covering arrays ⋮ Mixed covering arrays on graphs of small treewidth ⋮ Roux-type constructions for covering arrays of strengths three and four ⋮ Binary Covering Arrays and Existentially Closed Graphs ⋮ Covering arrays on product graphs ⋮ Mixed covering arrays on 3-uniform hypergraphs ⋮ Unnamed Item ⋮ A formal logic approach to constrained combinatorial testing ⋮ Constructing heterogeneous hash families by puncturing linear transversal designs ⋮ Augmentation of covering arrays of strength two ⋮ Constructing new covering arrays from LFSR sequences over finite fields ⋮ hClique: An exact algorithm for maximum clique problem in uniform hypergraphs ⋮ Locating and detecting arrays for interaction faults ⋮ A greedy algorithm to construct covering arrays using a graph representation ⋮ Improved strength four covering arrays with three symbols ⋮ Coloured and Directed Designs ⋮ Asymptotic and constructive methods for covering perfect hash families and covering arrays ⋮ Covering array EXtender ⋮ Strength two covering arrays: existence tables and projection ⋮ Tabu search for covering arrays using permutation vectors ⋮ A two-stage algorithm for combinatorial testing ⋮ Classification of orthogonal arrays by integer programming ⋮ Constructions of new orthogonal arrays and covering arrays of strength three ⋮ Randomized post-optimization of covering arrays ⋮ Covering arrays from cyclotomy ⋮ Consecutive covering arrays and a new randomness test ⋮ Covering and radius-covering arrays: constructions and classification ⋮ Mixed optimization combinatorial method for constructing covering arrays ⋮ Partial covering arrays: algorithms and asymptotics ⋮ Covering arrays of strength three from extended permutation vectors ⋮ Bipartite locating array ⋮ A Logic-Based Approach to Combinatorial Testing with Constraints ⋮ Covering arrays of strength 3 and 4 from holey difference matrices ⋮ Linear hash families and forbidden configurations ⋮ Arrays for combinatorial interaction testing: a review on constructive approaches ⋮ Merging covering arrays and compressing multiple sequence alignments ⋮ Disjoint Spread Systems and Fault Location ⋮ A survey of methods for constructing covering arrays ⋮ Cover starters for covering arrays of strength two ⋮ Resolvable covering arrays ⋮ Optimality and constructions of locating arrays ⋮ Improving two recursive constructions for covering arrays ⋮ Tower of covering arrays
Uses Software
This page was built for publication:
