A heuristic approach for constructing ternary covering arrays using trinomial coefficients

Authors:
Jorge Martinez-Pena;Jose Torres-Jimenez;Nelson Rangel-Valdez;Himer Avila-George
Affiliations:
CINVESTAV-Tamaulipas, Information Technology Laboratory, Cd. Victoria, Tamps., Mexico;CINVESTAV-Tamaulipas, Information Technology Laboratory, Cd. Victoria, Tamps., Mexico;CINVESTAV-Tamaulipas, Information Technology Laboratory, Cd. Victoria, Tamps., Mexico;Universidad Politécnica de Valencia, Instituto de Instrumentación para Imagen Molecular, Valencia, Spain
Venue:
IBERAMIA'10 Proceedings of the 12th Ibero-American conference on Advances in artificial intelligence
Year:
2010

Citing 5
Cited 1

Concrete Mathematics: A Foundation for Computer Science

Concrete Mathematics: A Foundation for Computer Science
In-Parameter-Order: A Test Generation Strategy for Pairwise Testing

HASE '98 The 3rd IEEE International Symposium on High-Assurance Systems Engineering
On t-Covering Arrays

Designs, Codes and Cryptography
Upper bounds for covering arrays by tabu search

Discrete Applied Mathematics
Constructions of new orthogonal arrays and covering arrays of strength three

Journal of Combinatorial Theory Series A

Supercomputing and grid computing on the verification of covering arrays

The Journal of Supercomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a simulated annealing (SA) algorithm for the construction of ternary covering arrays (CAs) using a trinomial coefficient representation. A ternary CA, denoted by CA(t, k, 3), is an N × k array where each N × t subarray contains each of the 3t combinations of symbols at least once. The construction of optimal CAs is, in general, an NP-complete problem. Many reported SA implementations use an N × k matrix representation for the CA construction. Instead of this, we represent ternary CAs using trinomial coefficients in order to reduce the search space for the SA algorithm.