A greedy-metaheuristic 3-stage approach to construct covering arrays (Q2198200): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q129760457, #quickstatements; #temporary_batch_1730723755668 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q129760457 / rank | |||
Normal rank | |||
Latest revision as of 13:36, 4 November 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
0 references
