A greedy-metaheuristic 3-stage approach to construct covering arrays (Q2198200): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 02:36, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A greedy-metaheuristic 3-stage approach to construct covering arrays |
scientific article |
Statements
A greedy-metaheuristic 3-stage approach to construct covering arrays (English)
0 references
9 September 2020
0 references
greedy algorithms
0 references
metaheuristic algorithms
0 references
covering arrays
0 references
3-stage approach
0 references
covering perfect hash families
0 references
simulated annealing
0 references
