Pages that link to "Item:Q5469151"
From MaRDI portal
The following pages link to Products of mixed covering arrays of strength two (Q5469151):
Displaying 32 items.
- Optimum detecting arrays for independent interaction faults (Q255973) (← links)
- Optimal locating arrays for at most two faults (Q424251) (← links)
- Optimum mixed level detecting arrays (Q464194) (← links)
- On the existence of orthogonal arrays OA\((3,5,4n+2)\) (Q616457) (← links)
- The equivalence between optimal detecting arrays and super-simple OAs (Q663478) (← links)
- Constructions of covering arrays of strength five (Q663479) (← links)
- A survey of methods for constructing covering arrays (Q763563) (← links)
- Cover starters for covering arrays of strength two (Q764881) (← links)
- Roux-type constructions for covering arrays of strengths three and four (Q851777) (← links)
- Constructing new covering arrays from LFSR sequences over finite fields (Q897312) (← links)
- Optimal and near-optimal mixed covering arrays by column expansion (Q998340) (← links)
- Covering arrays of strength 3 and 4 from holey difference matrices (Q1009124) (← links)
- Merging covering arrays and compressing multiple sequence alignments (Q1026121) (← links)
- Randomized post-optimization of covering arrays (Q1761502) (← links)
- A construction of variable strength covering arrays (Q2025162) (← links)
- A greedy-metaheuristic 3-stage approach to construct covering arrays (Q2198200) (← links)
- A greedy algorithm to construct covering arrays using a graph representation (Q2201668) (← links)
- Covering array EXtender (Q2242769) (← links)
- Mixed covering arrays of strength three with few factors (Q2276196) (← links)
- Bipartite locating array (Q2287790) (← links)
- Covering arrays: using prior information for construction, evaluation and to facilitate fault localization (Q2301220) (← links)
- Arrays for combinatorial interaction testing: a review on constructive approaches (Q2303506) (← links)
- Optimality and constructions of locating arrays (Q2322059) (← links)
- Improving two recursive constructions for covering arrays (Q2322060) (← links)
- Covering arrays on product graphs (Q2409504) (← links)
- Mixed covering arrays on 3-uniform hypergraphs (Q2410218) (← links)
- Locating and detecting arrays for interaction faults (Q2426663) (← links)
- Strength two covering arrays: existence tables and projection (Q2470443) (← links)
- Disjoint Spread Systems and Fault Location (Q2830441) (← links)
- MiTS in Depth: An Analysis of Distinct Tabu Search Configurations for Constructing Mixed Covering Arrays (Q2866118) (← links)
- Generalized covering designs and clique coverings (Q3100732) (← links)
- Subspace restrictions and affine composition for covering perfect hash families (Q5198019) (← links)
