Optimal shortening of uniform covering arrays.
Software test suites based on the concept of interaction testing are very useful for testing software components in an economical way. Test suites of this kind may be created using mathematical objects called covering arrays. A covering array, denoted by CA(N; t, k, v), is an N × k array over [Formu...
Main Authors: | Jose Torres-Jimenez, Nelson Rangel-Valdez, Himer Avila-George, Oscar Carrizalez-Turrubiates |
---|---|
Format: | Article |
Language: | English |
Published: |
Public Library of Science (PLoS)
2017-01-01
|
Series: | PLoS ONE |
Online Access: | http://europepmc.org/articles/PMC5739513?pdf=render |
Similar Items
-
Methods to Construct Uniform Covering Arrays
by: Jose Torres-Jimenez, et al.
Published: (2019-01-01) -
Constructing Covering Arrays using Parallel Computing and Grid Computing
by: Avila George, Himer
Published: (2012) -
New Bounds for Ternary Covering Arrays Using a Parallel Simulated Annealing
by: Himer Avila-George, et al.
Published: (2012-01-01) -
Design of rate-compatible LDPC codes based on uniform shortening distribution
by: Arisa Wongsriwor, et al.
Published: (2018-05-01) -
Genetic Algorithm based Optimization of Uniform Circular Array
by: V. Kumar, et al.
Published: (2020-12-01)