31 results on '"Colbourn, Charles J."'
Search Results
2. Efficient Greedy Algorithms with Accuracy Guarantees for Combinatorial Restrictions
3. Algorithmic methods for covering arrays of higher index
4. On a Combinatorial Framework for Fault Characterization
5. Asymptotic and constructive methods for covering perfect hash families and covering arrays
6. Randomized Post-optimization for t-Restrictions
7. Randomized Postoptimization of Covering Arrays
8. Augmentation of Covering Arrays of Strength Two
9. Resolvable Covering Arrays
10. Improving Two Recursive Constructions for Covering Arrays
11. Optimality and Constructions of Locating Arrays
12. Constructing heterogeneous hash families by puncturing linear transversal designs
13. Covering arrays from cyclotomy
14. Linear hash families and forbidden configurations
15. Locating and detecting arrays for interaction faults
16. Roux-type constructions for covering arrays of strengths three and four
17. Covering Arrays of Strength Three
18. Two‐stage algorithms for covering array construction.
19. Locating one pairwise interaction: Three recursive constructions.
20. UPPER BOUNDS ON THE SIZE OF COVERING ARRAYS.
21. DISJOINT SPREAD SYSTEMS AND FAULT LOCATION.
22. Covering arrays, augmentation, and quilting arrays.
23. In-Parameter-Order strategies for covering perfect hash families.
24. SEQUENCE COVERING ARRAYS.
25. Cover starters for covering arrays of strength two
26. Mixed covering arrays of strength three with few factors
27. Tabu search for covering arrays using permutation vectors
28. Constructing strength three covering arrays with augmented annealing
29. Strength two covering arrays: Existence tables and projection
30. The density algorithm for pairwise interaction testing.
31. Detecting and Locating Interaction Faults.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.