CONSTRUCTION OF MIXED COVERING ARRAYS OF STRENGTHS 2 THROUGH 6 USING A TABU SEARCH APPROACH

Simple item page
AudienciaPúblico en generales_ES
CoberturaMéxicoes_ES
Fecha de ingreso2026-09-15T00:30:39Z
Fecha de publicación2012-08-06
ResumenThe development of a new software system involves extensive tests of the software functionality in order to identify possible failures. Also, a software system already built requires a fine tuning of its configurable options to give the best performance in the environment where it is going to work. Both cases require a finite set of tests that avoids testing all the possible combinations (which is time consuming); to this situation mixed covering arrays (MCAs) are a feasible alternative. MCAs are combinatorial structures having a case per row. MCAs are small, in comparison with exhaustive search, and guarantee a level of interaction among the involved parameters (a difference with random testing). We present a tabu search algorithm (TSA) for the construction of MCAs. Also, we report the fine tuning process used to identify the best parameter values for TSA. The analyzed TSA parameters were three different initialization functions, five different tabu list sizes and the mixture of four neighborhood functions. The performance of TSA was evaluated with two benchmarks previously reported. The results showed that TSA improved the algorithms IPOG-F, ITCH, Jenny, TConfig, and TVG in relation with the size of the constructed matrices. Particularly, TSA found the optimal size in 20 of the 23 cases tested.es_ES
Doihttps://doi.org/10.1142/s1793830912500334es_ES
URIhttps://riuat.uat.edu.mx/handle/123456789/2624
Idiomaenes_ES
EditorialWorld Scientifices_ES
RelaciónDiscrete Mathematics Algorithms and Applicationses_ES
URL relacionadohttps://doi.org/10.1142/s1793830912500334es_ES
DerechosAcceso restringido / Suscripción (Metadatos de producción científica)es_ES
Licenciahttp://purl.org/coar/access_right/c_16eces_ES
FuenteDiscrete Mathematics Algorithms and Applications
Palabra claveTabu searches_ES
Palabra claveInitializationes_ES
Palabra claveSoftwarees_ES
Palabra claveComputer sciencees_ES
Palabra claveSet (abstract data type)es_ES
Palabra claveAlgorithmes_ES
Palabra claveProcess (computing)es_ES
Palabra claveRelation (database)es_ES
Palabra claveSensitivity (control systems)es_ES
Palabra claveMathematical optimizationes_ES
Palabra claveMathematicses_ES
Palabra claveData mininges_ES
ClasificaciónSoftware Testing and Debugging Techniqueses_ES
TítuloCONSTRUCTION OF MIXED COVERING ARRAYS OF STRENGTHS 2 THROUGH 6 USING A TABU SEARCH APPROACHes_ES
TipoArtículoes_ES
ArbitradoHa sido Arbitradoes_ES
AutorGonzalez-Hernandez, Loreto
AutorRangel-Valdez, Nelson
AutorTorres-Jiménez, José
AutorGonzalez-Hernandez, Loretoes_ES
AutorRangel-Valdez, Nelsones_ES
AutorTorres-Jiménez, Josées_ES
InstituciónUniversidad Autónoma de Tamaulipas
InstituciónUniversidad Autónoma de Tamaulipases_ES
Número03es_ES
Rango de páginas1250033-1250033es_ES
URL relacionadahttps://doi.org/10.1142/s1793830912500334
Tipo de artículoIndexado
Tipo de artículoIndexadoes_ES
Volumen04es_ES

Files

Collections

Documentación Cientifica