Add to ORKGThis paper presents an algorithm which finds all non-isomorphic covering arrays of a given size on a binary alphabet. The algorithm is an implemen-tation of a backtracking procedure which generates all covering arrays (with the given parameters) and rejects non-canonical arrays. Important in this al
The minimum number of rows in covering arrays (equivalently, surjective codes) and radius-covering a...
Abstract. Regularities in degenerate strings have recently been a matter of interest because of thei...
Covering arrays for words of length (Formula presented.) over a (Formula presented.) -letter alphabe...
Abstract. A Covering Array denoted by CA(N; t, k, v) is a matrix of size N × k, in which each of the...
The problem of classifying all isomorphism classes of OA(N,k,s,t)'s is shown to be equivalent to fin...
Covering arrays are combinatorial structures which extend the notion of orthogonal arrays and have a...
Abstract. This paper presents a new Memetic Algorithm (MA) de-signed to compute near-optimal solutio...
Software test suites based on the concept of interaction testing are very useful for testing softwar...
Covering arrays generalize orthogonal arrays by requiring that t -tuples be covered, but not requiri...
A proper fact or u of a string y is a cover of y if every letter of y is within some occurrence of u...
AbstractCovering arrays (CAs) can be used to detect the existence of faulty pairwise interactions be...
AbstractCovering arrays are combinatorial structures which extend the notion of orthogonal arrays an...
Our aim is to present a practical algorithm for the isomorphism problem that can be easily adapted t...
A Branch-and-Cut algorithm for nding covering designs is presented. Its original-ity resides in the ...
Let x denote a given nonempty string of length n = |x| . A proper substring u of x is a proper cover...
The minimum number of rows in covering arrays (equivalently, surjective codes) and radius-covering a...
Abstract. Regularities in degenerate strings have recently been a matter of interest because of thei...
Covering arrays for words of length (Formula presented.) over a (Formula presented.) -letter alphabe...
Abstract. A Covering Array denoted by CA(N; t, k, v) is a matrix of size N × k, in which each of the...
The problem of classifying all isomorphism classes of OA(N,k,s,t)'s is shown to be equivalent to fin...
Covering arrays are combinatorial structures which extend the notion of orthogonal arrays and have a...
Abstract. This paper presents a new Memetic Algorithm (MA) de-signed to compute near-optimal solutio...
Software test suites based on the concept of interaction testing are very useful for testing softwar...
Covering arrays generalize orthogonal arrays by requiring that t -tuples be covered, but not requiri...
A proper fact or u of a string y is a cover of y if every letter of y is within some occurrence of u...
AbstractCovering arrays (CAs) can be used to detect the existence of faulty pairwise interactions be...
AbstractCovering arrays are combinatorial structures which extend the notion of orthogonal arrays an...
Our aim is to present a practical algorithm for the isomorphism problem that can be easily adapted t...
A Branch-and-Cut algorithm for nding covering designs is presented. Its original-ity resides in the ...
Let x denote a given nonempty string of length n = |x| . A proper substring u of x is a proper cover...
The minimum number of rows in covering arrays (equivalently, surjective codes) and radius-covering a...
Abstract. Regularities in degenerate strings have recently been a matter of interest because of thei...
Covering arrays for words of length (Formula presented.) over a (Formula presented.) -letter alphabe...