### Table 1: Ordinary one-step -reduction

### Table 3. One-Step Forecast Accuracy.

### Table 1: One-step evaluation relation. is de ned by

1993

"... In PAGE 6: ... To handle imperative features, our operational rules will manipulate \stores quot; in addition to terms, where a store is a nite partial map from location constants to values. The basic one-step evaluation relation 7?! is de ned in Table1 , with (e; s) 7?! (r; s0) indicating that the expression e in store s evaluates in one step to the result r resulting in new store s0 . The result r is either another expression or the run-time error wrong .... ..."

Cited by 12

### Table 4: One-Step Methods of the Same Order.

2001

"... In PAGE 30: ... 9.1 One-Step Methods Same Order Table4 reports the experimental results for the IHOB4A3B5(D4BN D4) and GHF(D4BN D4) methods of order BED4 B7 BD on several benchmarks, orders, and step sizes. In general, for a given step size, GHF and IHOA3 have a similar accuracy and execution time.... ..."

Cited by 2

### Table 8 One-step classification using complete spectra

2004

"... In PAGE 12: ... This stratified random sam- pling is repeated for 200 runs. The results are shown in Table8 for one-step classification, which assigns the spectra to one of the three following classes: 2, 4 or 5. Table 9 shows the classifier performance after two-steps classification, which assigns the spectra to 1 of the 4 following classes: 1, 2, 3 or 4.... ..."

### Table 5 One-Step Estimation of Equations (4) and (5):

2000

"... In PAGE 25: ...eriods (i.e., a total of kt dummies). In the one-step method, there are only k time-invariant Federal Reserve district dummies, and macro effects are modelled much more parsimoniously as a linear function of changes in monetary policy and GDP.33 Table5 presents an overview of the estimates of N generated by the one-step approach. As can be seen, the point estimates are generally quite close to those in Table 3.... In PAGE 28: ... If we base our calculation on the bivariate small-bank/big-bank coefficient differential of -.1327 in Panel A of Table5 , we get a 5.3% gap in the level of C amp;I loans across the liquid and illiquid small banks one year after the rise in the funds rate.... ..."

Cited by 13

### Table 4: One-Step Methods of the Same Order.

"... In PAGE 31: ... 9.1 One-Step Methods Same Order Table4 reports the experimental results for the IHOa109 a1 a111 (a0 a18 a0 ) and GHF(a0 a18 a0 ) methods of order a15 a0 a56 a80 on several benchmarks, orders, and step sizes. In general, for a given step size, GHF and IHOa1 have a similar accuracy and execution time.... ..."

### Table 5: The procedure for executing the one-step greedy policy.

2000

Cited by 239

### Table 5: The procedure for executing the one-step greedy policy.

2000

Cited by 239

### Table 1: high resolution one-step inferences

"... In PAGE 1: ...Work supported by NSF grant No. CCR-9301031. q p q p q p q p q p q p disjoint(p,q) meet(p,q) overlap(p,q) covered_by(p,q) covers(q,p) inside(p,q) contains(q,p) equal(p,q) Figure 1: topological relations (high resolution case) disjoint. The complete table of such one-step inferences was derived in [Egenhofer,1991; Smith and Park,1992] (see Table1 ; notice that this is an extension |as we shall see, a surprisingly subtle one| of Allen apos;s classical work on temporal intervals [Allen,1983]). In some cases the re nement provided by the high res- olution relations is not needed.... In PAGE 4: ... Constraint satisfac- tion problems are typically NP-complete, although spe- cial classes can be solved in polynomial time. In the constraint satisfaction problems arising in con- nection to topological inference, the variables are pairs of distinct objects; all domains are the subsets of the set of eight topological relations in Table1 (or the ve in Ta- bles 2 and 3, or the two in Table 4), as dictated by the clause corresponding to the pair of objects; and for each triple (i; j; k) of objects we have a constraint, namely, that the value of the pair i; j, the value of the pair j; k, and the value of the pair i; k must be related as in Table 1 (or 2, or 3, or 4). For example, the topological expression (A overlaps B _ A equal B) ^ (B contains C) ^ (A inside D _ A contains D) is expressed by six variables (all unordered pairs of ob- jects from A, B, C, D).... ..."