Sentence examples for covering array from inspiring English sources

A compact representation of certain covering arrays employs "permutation vectors" to encode vt×1 subarrays of the covering array so that a covering perfect hash family whose entries correspond to permutation vectors yields a covering array.

Given a weighted 3-uniform hypergraph H, a mixed covering array on H with minimum size is called optimal.

A TCA of height h is a succession of h+1 covering arrays C0,C1,…,Ch in which for i= 1,2,…,h the covering array Ci is one unit greater in the number of factors and the strength of the covering array Ci−1; this way, if the covering array C0 is of strength t and has k factors then the covering arrays C1,…,Ch are of strength t+1,…,t+h and have k+1,…,k+h factors respectively.

We note that the ratio between the number of rows of the last covering array Ch in a TCA of height h and the number of rows of the best known covering array for the same values of t, k, and v as for Ch is reduced as h grows.

A covering array CA N t,k,v) is an N×k array, in which in every N×t subarray, each of the vt possible t-tuples over v symbols occurs at least once.

A covering array of strength t and order v is an N×k array over Zv with the property that every N×t subarray covers all members of Ztv at least once.

In this work we explore the construction of a Tower of Covering Arrays (TCA) as a way to produce covering arrays that improve or match some current upper bounds.

Covering arrays are sometimes also called t-surjective arrays or qualitatively t-independent families; when t=2 covering arrays are also called group covering designs or transversal covers.

This paper describes constructions for strength-2 mixed covering arrays developed from index-1 orthogonal arrays, ordered designs and covering arrays.

In this work a tabu search heuristic is used to construct covering arrays that improve on the previously known upper bounds on the sizes of optimal covering arrays.

The second is refining computational search algorithms to find smaller covering arrays more quickly.