### Table 21. Data of the reduction steps for (C36)

1999

Cited by 7

### Table 1. The six reduction steps of the lexicon lattice.

2000

Cited by 4

### Table 1: Reduction steps on the CCAM for various functions

### Table 8. Model sizes and solution time for Example 4 Solution MILP-1 Solution NLP Solution MILP-2 Outer

1914

"... In PAGE 21: ...5% requiring 5 iterations in the inner optimization. Table8 shows the computing times and the problem sizes. The total time required by the algorithm was 11.... In PAGE 37: ... Table 7. Solution steps for Example 4 Table8 . Model sizes and solution time for Example 4 Table 9: Distribution of the pollutant Hej and concentration of pollutant in organic phase Coj Table 10: Inlet Streams data for Example 5 Table 11: Cost and removal ratio data for the equipments in Example 5 Table 12.... ..."

Cited by 1

### Table 1. Reduction steps on the CCAM for various functions in the text Computation Reductions

1998

"... In PAGE 5: ... Although CCAM code is rather abstract in comparison to native machine code, we can still observe performance improvements by counting the number of reduc- tions performed by our CCAM simulator. Table1 summerizes the observed reduc- tion counts for the di erent versions of the polynomial evaluator, measured using our ML2 compiler and CCAM simulator. Using our ML2 compiler and CCAM simulator, we observe the reduction counts in Table 1 for the di erent versions of the polynomial evaluator.... In PAGE 5: ... Table 1 summerizes the observed reduc- tion counts for the di erent versions of the polynomial evaluator, measured using our ML2 compiler and CCAM simulator. Using our ML2 compiler and CCAM simulator, we observe the reduction counts in Table1 for the di erent versions of the polynomial evaluator. 5.... ..."

Cited by 23

### Table 2: Local Reduction Steps of First-Order System

1998

"... In PAGE 2: ... Code for methods in method override and object extension is then coerced to expect such stripped objects. The relation in Table2 is extended to a one-step evaluation relation on programs by e ; e0 () 9e1;e2: e = E[e1] ^ e1 ; e2 ^ E[e2] = e0: We can prove Proposition 1 (Determinacy) The relation ; is a partial function. We use ; to denote the reflexive, transitive closure of ;.... ..."

Cited by 52

### Table 2: Local Reduction Steps of First-Order System

1998

"... In PAGE 2: ... Code for methods in method override and object extension is then coerced to expect such stripped objects. The relation in Table2 is extended to a one-step evaluation relation on programs by e ; e0 () 9e1;e2: e = E[e1] ^ e1 ; e2 ^ E[e2] = e0: We can prove Proposition 1 (Determinacy) The relation ; is a partial function. We use ; to denote the reflexive, transitive closure of ;.... ..."

Cited by 52