Upper bounds for covering arrays by tabu search. (Q1428561): Difference between revisions

@@ Property / cites work @@
+New techniques for designing qualitatively independent systems
+Normal rank
@@ Property / cites work @@
+Q4876930
@@ Property / cites work: Q4876930 / rank @@
+Normal rank
@@ Property / cites work @@
+Sperner capacities
@@ Property / cites work: Sperner capacities / rank @@
+Normal rank
@@ Property / cites work @@
+Tabu Search—Part I
@@ Property / cites work: Tabu Search—Part I / rank @@
+Normal rank
@@ Property / cites work @@
+On qualitatively independent partitions and related problems
+Normal rank
@@ Property / cites work @@
+On the maximum number of qualitative independent partitions
+Normal rank
@@ Property / cites work @@
+Vector sets for exhaustive testing of logic circuits
+Normal rank
@@ Property / cites work @@
+Covering arrays and intersecting codes
@@ Property / cites work: Covering arrays and intersecting codes / rank @@
+Normal rank
@@ Property / cites work @@
+Q5461518
@@ Property / cites work: Q5461518 / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds for transversal covers
@@ Property / cites work: Lower bounds for transversal covers / rank @@
+Normal rank