### Table 1: Benchmark for the minimum 2-sum problem.

2004

### Table 3: Sum of response time functions f1 and F1. The minimum value on each assignment diagonal is marked by *.

1994

"... In PAGE 10: ... As before, let F1 denote the response time function for 1. Table3 gives the values of f1(u)+F1(v) for all 1 u; v lt; 8 with u+v 8. The set of possible sums associated with allocating a xed number of processors x lie on an assignment diagonal moving from the lower left (assign x ? 1 processors to 1, one to t1) to the upper right (assign one processor to 1, x ? 1 to t1) of the table, illustrated by use of a common typeface on a diagonal.... ..."

Cited by 16

### Table 10: Performance of Level and Sum heuristics in searching longer planning graphs

in Planning Graph as the Basis for Deriving Heuristics for Plan Synthesis by State Space and CSP Search

2002

"... In PAGE 33: ...Table 10: Performance of Level and Sum heuristics in searching longer planning graphs Table 9 shows the performance of Graphplan with the Max heuristic, when the search is conducted starting from the level where minimum length solution occurs, as well as 3, 5 and 10 levels above this level. Table10 shows the same experiments with with the Level and Sum heuristics. The results in these tables show that Graphplan with a level-based variable and value ordering heuristic is surprisingly robust with respect to searching on longer planning graphs.... ..."

Cited by 51

### Table 11: Performance of Level and sum heuristics in searching longer planning graphs

in Planning Graph as the Basis for Deriving Heuristics for Plan Synthesis by State Space and CSP Search

2002

"... In PAGE 34: ... Table 10 shows the performance of Graphplan with the Max heuristic, when the search is conducted starting from the level where minimum length solution occurs, as well as 3, 5 and 10 levels above this level. Table11 shows the same experiments with with the level and sum heuristics. The results in these tables show that Graphplan with a level-based variable and value ordering heuristic is surprisingly robust with respect to searching on longer planning graphs.... ..."

Cited by 51

### Table 12: Minimum number of columns as a function of congestion weighting factor, 4-input RLBs. Netlists that failed to route were assigned a value of 17 for computing the sum.

2006

"... In PAGE 9: ...omputing the sum.................................................................................................... 48 Table12 : Minimum number of columns as a function of congestion weighting factor, 4-input RLBs. Netlists that failed to route were assigned a value of 17 for computing the sum.... ..."

### Table 5: Performance of Level and Sum heuristics in searching longer planning graphs

2000

"... In PAGE 5: ... Table 4 shows the performance of Graphplan with the Mop heuristic, when the search is conducted starting from the level where minimum length solution occurs, as well as 3, 5 and 10 levels above this level. Table5 shows the same experiments with with the Level and Sum heuristics. The results in these tables show that Graphplan with a level-based variable and value ordering heuristic is surprisingly robust with respect to searching on longer planning graphs.... ..."

Cited by 4

### Table 5: Performance of Level and Sum heuristics in searching longer planning graphs

2000

"... In PAGE 5: ... Table 4 shows the performance of Graphplan with the Mop heuristic, when the search is conducted starting from the level where minimum length solution occurs, as well as 3, 5 and 10 levels above this level. Table5 shows the same experiments with with the Level and Sum heuristics. The results in these tables show that Graphplan with a level-based variable and value ordering heuristic is surprisingly robust with respect to searching on longer planning graphs.... ..."

Cited by 4

### Table 29 : Calculation of minimum and maximum recycling rate for the EU Minimum recycling rates

2003

"... In PAGE 19: ...able 28 : Optimal recycling ranges per case study.......................................................................99 Table29 : Calculation of minimum and maximum recycling rate for the EU.... In PAGE 113: ... In order to obtain ranges of recycling targets, the minimum and maximum optimal recycling rates are successively applied to the packaging mix of each Member State. Table29 illustrates the calculation of the range of global optimal recycling rate for the European Union. The packaging mix considered is the sum of the packaging amount arising in all the Member States.... ..."

### Table 10: Minimum number of columns as a function of routeability cost weighting parameter C. Netlists that failed to route were assigned a value of 17 for computing the sum.

2006

"... In PAGE 9: ...um............................................................................................................................ 47 Table10 : Minimum number of columns as a function of routeability cost weighting parameter C. Netlists that failed to route were assigned a value of 17 for computing the sum.... In PAGE 41: ... Figure 19 shows the results for the local route cost weighting parameter C. The performance is highly similar over a wide range of nonzero values (see also Table10 in ... ..."

### Table 7: Residual sum of squares for estimated curves in Figure 5.

"... In PAGE 25: ... All three methods underestimate the observed rather sudden high proportion of the population in stage 2 at 45 hours, and it is clear that this particular Erlangian distribution is probably inappropriate for stage 2. This lack of t for stage 2 is also re ected in the RSS ( Table7 ). The minimum variance approach has the highest RSS for all stages, suggesting that this approach for selecting s values may be more in uenced by outlying values than is the iterated approach.... ..."