Pages that link to "Item:Q1428561"
From MaRDI portal
The following pages link to Upper bounds for covering arrays by tabu search. (Q1428561):
Displaying 25 items.
- Structures and lower bounds for binary covering arrays (Q449145) (← links)
- A formal logic approach to constrained combinatorial testing (Q616856) (← links)
- Covering and radius-covering arrays: constructions and classification (Q708354) (← links)
- A survey of methods for constructing covering arrays (Q763563) (← links)
- Cover starters for covering arrays of strength two (Q764881) (← links)
- Constraint models for the covering test problem (Q850459) (← 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)
- Tabu search for covering arrays using permutation vectors (Q953845) (← links)
- Computational cost of the Fekete problem. I: The forces method on the 2-sphere (Q1017591) (← links)
- Merging covering arrays and compressing multiple sequence alignments (Q1026121) (← links)
- Randomized post-optimization of covering arrays (Q1761502) (← links)
- Sliced AETG: a memory-efficient variant of the AETG covering array generation algorithm (Q2193001) (← links)
- A greedy algorithm to construct covering arrays using a graph representation (Q2201668) (← links)
- Covering array EXtender (Q2242769) (← links)
- Arrays for combinatorial interaction testing: a review on constructive approaches (Q2303506) (← links)
- Locating and detecting arrays for interaction faults (Q2426663) (← links)
- Strength two covering arrays: existence tables and projection (Q2470443) (← links)
- MiTS in Depth: An Analysis of Distinct Tabu Search Configurations for Constructing Mixed Covering Arrays (Q2866118) (← links)
- On the state of strength-three covering arrays (Q3150159) (← links)
- CONSTRUCTION OF MIXED COVERING ARRAYS OF STRENGTHS 2 THROUGH 6 USING A TABU SEARCH APPROACH (Q3166745) (← links)
- Algebraic Modelling of Covering Arrays (Q4610003) (← links)
- A primer on the application of neural networks to covering array generation (Q5043857) (← links)
- Binary Covering Arrays and Existentially Closed Graphs (Q5322995) (← links)
- A Logic-Based Approach to Combinatorial Testing with Constraints (Q5458811) (← links)