Pages that link to "Item:Q924952"
From MaRDI portal
The following pages link to Constructing strength three covering arrays with augmented annealing (Q924952):
Displaying 20 items.
- A construction for strength-3 covering arrays from linear feedback shift register sequences (Q404947) (← links)
- A two-stage algorithm for combinatorial testing (Q519759) (← links)
- A survey of methods for constructing covering arrays (Q763563) (← links)
- Constructing new covering arrays from LFSR sequences over finite fields (Q897312) (← links)
- Tabu search for covering arrays using permutation vectors (Q953845) (← links)
- Covering arrays from cyclotomy (Q970532) (← links)
- Merging covering arrays and compressing multiple sequence alignments (Q1026121) (← links)
- Asymptotic and constructive methods for covering perfect hash families and covering arrays (Q1741930) (← links)
- Randomized post-optimization of covering arrays (Q1761502) (← links)
- In-parameter-order strategies for covering perfect hash families (Q2079142) (← links)
- Sliced AETG: a memory-efficient variant of the AETG covering array generation algorithm (Q2193001) (← links)
- Covering array EXtender (Q2242769) (← links)
- Improved covering arrays using covering perfect hash families with groups of restricted entries (Q2287570) (← links)
- Resolvable covering arrays (Q2320870) (← links)
- Improving two recursive constructions for covering arrays (Q2322060) (← links)
- Classification of orthogonal arrays by integer programming (Q2475747) (← links)
- Bounds for covering codes over large alphabets (Q2572977) (← links)
- Covering arrays, augmentation, and quilting arrays (Q2920882) (← links)
- (Q5074287) (← links)
- Subspace restrictions and affine composition for covering perfect hash families (Q5198019) (← links)
