A greedy-metaheuristic 3-stage approach to construct covering arrays (Q2198200): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Created claim: Wikidata QID (P12): Q129760457, #quickstatements; #temporary_batch_1730723755668
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Orthogonal Arrays of Index Unity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strength two covering arrays: existence tables and projection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic and constructive methods for covering perfect hash families and covering arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Products of mixed covering arrays of strength two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two applications (for search theory and truth functions) of Sperner type theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Families of \(k\)-independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial covering arrays: algorithms and asymptotics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering arrays of higher strength from permutation vectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two-stage algorithm for combinatorial testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu search for covering arrays using permutation vectors / rank
 
Normal rank
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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references