A greedy-metaheuristic 3-stage approach to construct covering arrays (Q2198200)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7245679
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A greedy-metaheuristic 3-stage approach to construct covering arrays |
scientific article; zbMATH DE number 7245679 |
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
0 references
0.8966546
0 references
0.86509657
0 references
0.8642839
0 references
0.85876405
0 references
0.85602766
0 references
0.85394216
0 references
0.8510138
0 references
