.png){kind=icon}
.png){kind=icon}
Return
Methods to Construct Uniform Covering Arrays
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2019.2907057.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Uniform covering arrays are covering arrays in which every column has the same alphabet. In recent years, a number of methods to construct such arrays have been developed. Here, we review several of these methods organizing them into six classes: algebraic, recursive, exact, greedy, metaheuristic, and transformations. The objective of this paper is to highlight the strategy of some representative algorithms of each class. Most of the reviewed methods are accompanied by examples and/or pseudocodes. This paper ends with a discussion about the general strengths and weaknesses of each class of methods.
Keywords:
Covering arrays
uniform covering arrays
methods to construct covering arrays
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.6
Papers:
9.8W
Citations:
29.4W