A graph‐based postoptimization approach for covering arrays

Simple item page
AudienciaPúblico en generales_ES
CoberturaMéxicoes_ES
Fecha de ingreso2026-09-15T00:30:19Z
Fecha de publicación2017-01-01
ResumenAbstractCovering arrays (CAs) are combinatorial objects with interesting features that have practical applications such as experimental design and fault detection in hardware and software. We introduce a graph‐based postoptimization (GBPO) approach to reduce the size of CAs exploiting the redundancy in CAs previously constructed. To evidence the advantages of using GBPO, we have instantiated it with 2 sets of CAs: (1) 560 CAs of strength 2≤t≤6, alphabet 2≤v≤6, and parameters 3≤k≤32 generated by an optimized version of In‐Parameter‐Order‐Generalized (IPOG‐F) and GBPO improved all CAs, and 37 cases matched the best‐known upper bounds; and (2) 32 CAs of strengtht=2, alphabet 3≤v≤6, and number of parameters 8≤k≤146; in this set, 16 cases were improved, and 16 cases were matched.es_ES
Doihttps://doi.org/10.1002/qre.2176es_ES
URIhttps://riuat.uat.edu.mx/handle/123456789/2263
Idiomaeses_ES
EditorialWileyes_ES
RelaciónQuality and Reliability Engineering Internationales_ES
URL relacionadohttps://doi.org/10.1002/qre.2176es_ES
DerechosAcceso abierto (Metadatos de producción científica)es_ES
Licenciahttp://purl.org/coar/access_right/c_abf2es_ES
FuenteQuality and Reliability Engineering International
TítuloA graph‐based postoptimization approach for covering arrayses_ES
TipoArtículoes_ES
ArbitradoHa sido Arbitradoes_ES
AutorPerez‐Torres, Jose Carlos
AutorTorres‐Jimenez, Jose
AutorPerez‐Torres, Jose Carloses_ES
AutorTorres‐Jimenez, Josees_ES
InstituciónUniversidad Autónoma de Tamaulipas
InstituciónUniversidad Autónoma de Tamaulipases_ES
Número8es_ES
Rango de páginas2171-2180es_ES
URL relacionadahttps://doi.org/10.1002/qre.2176
Tipo de artículoIndexado
Tipo de artículoIndexadoes_ES
Volumen33es_ES

Files

Collections

Documentación Cientifica