### Table 11: Random examples.

1993

"... In PAGE 27: ...Table 11: Random examples. Table11 provides typical results for random problems. The rst two columns give the number of items and the number of knapsacks.... ..."

Cited by 4

### Table 2. Random Examples

"... In PAGE 6: ...emark 3.2. The relation algorithm for checking connectedness has very good worst case complexity. It is not so e cient in the average case, as shown below, see Table2 . Let us detail another algorithm for checking the connectedness of F; G 2 0 = fH1; : : : ; Hlg: we examine H1; H2; : : : the elements of fF; Gg and pose F0 = F; if Hi \ F0 6 = ; we substitute F 0 with F0 [ Hi and delete Hi from .... ..."

### Table 2 Experimental results (random examples)

"... In PAGE 75: ...261 represents a relatively simple task graph, we tried our heuristic on large randomly generated task graph examples. The results are presented in Table2 . Each of the experiments consists of the same set of 20 randomly generated task graphs.... In PAGE 91: ...261 presented in [1]. For this example, we present results obtained when using algorithmic pipelin- ing in Table2 . The pipeline implementation was constrained by defining the latency of one application iteration to be at most 4000 clocks and an activation period to be 1000 clocks.... ..."

### Table 2: Experimental results for random examples

2001

"... In PAGE 4: ...imes1 Corp. and the system works well on practical examples. All our results in this section have been obtained on an Intel P2 (333 Mhz). In Table2 results for 30 instances are given. For each instance, the table shows the minimum cost found and the number of iterations needed for finding this cost.... ..."

Cited by 6

### Table 4. Encoding 150 random examples of illegal using model complexity and

"... In PAGE 17: ... The results show remarkable similarity, with the same preferred theory, T 7 , emerging at the same point. Table4 reproduces the data of Figures 4 and 5 at the point of 150 examples. Theory complexity Ln28Tn29 is measured after augmentation; the number of examples augmenting the theory are given in the second column.... ..."

### TABLE III Experimental results of adaptive algorithm selection and scheduling for random examples.

### Table 6.2.8. Distribution of Minterms for the Random Examples.

1986