Metaheuristic algorithms for building Covering Arrays: A review
Covering Arrays (CA) are mathematical objects used in the functional testing of software components. They enable the testing of all interactions of a given size of input parameters in a procedure, function, or logical unit in general, using the minimum number of test cases. Building CA is a complex...
Principais autores: | Timaná-Peña, Jimena Adriana, Cobos-Lozada, Carlos Alberto, Torres-Jimenez, Jose |
---|---|
Formato: | Online |
Idioma: | eng |
Publicado em: |
Universidad Pedagógica y Tecnológica de Colombia
2016
|
Assuntos: | |
Acesso em linha: | https://revistas.uptc.edu.co/index.php/ingenieria/article/view/5295 |
- Registros relacionados
-
Initialization and Local Search Methods Applied to the Set Covering Problem: A Systematic Mapping
por: Quemá-Taimbud, Nelson-Enrique, et al.
Publicado em: (2023) -
Comparative analysis of granular neighborhoods in a Tabu Search for the vehicle routing problem with heterogeneous fleet and variable costs (HFVRP)
por: Escobar, John Wilmer, et al.
Publicado em: (2017) -
Design of LMI+I controller based in optimization for two degree of Freedom Helicopter
por: Higuera-Martínez, Oscar Iván, et al.
Publicado em: (2007) -
Adaptation, Comparison, and Improvement of Metaheuristic Algorithms to the Part-of-Speech Tagging Problem
por: Solano-Jiménez, Miguel Alexis, et al.
Publicado em: (2020) -
Measuring Representativeness Using Covering Array Principles
por: Castro-Romero, Alexander, et al.
Publicado em: (2023)