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...
主要な著者: | Timaná-Peña, Jimena Adriana, Cobos-Lozada, Carlos Alberto, Torres-Jimenez, Jose |
---|---|
フォーマット: | Online |
言語: | eng |
出版事項: |
Universidad Pedagógica y Tecnológica de Colombia
2016
|
主題: | |
オンライン・アクセス: | https://revistas.uptc.edu.co/index.php/ingenieria/article/view/5295 |
- 類似資料
-
Initialization and Local Search Methods Applied to the Set Covering Problem: A Systematic Mapping
著者:: Quemá-Taimbud, Nelson-Enrique, 等
出版事項: (2023) -
Comparative analysis of granular neighborhoods in a Tabu Search for the vehicle routing problem with heterogeneous fleet and variable costs (HFVRP)
著者:: Escobar, John Wilmer, 等
出版事項: (2017) -
Design of LMI+I controller based in optimization for two degree of Freedom Helicopter
著者:: Higuera-Martínez, Oscar Iván, 等
出版事項: (2007) -
Adaptation, Comparison, and Improvement of Metaheuristic Algorithms to the Part-of-Speech Tagging Problem
著者:: Solano-Jiménez, Miguel Alexis, 等
出版事項: (2020) -
Measuring Representativeness Using Covering Array Principles
著者:: Castro-Romero, Alexander, 等
出版事項: (2023)