### Table 2: A small collection of CSFR episodes, E.

2004

"... In PAGE 3: ... Thus, a significantly smaller space of possible experiences can be derived by summariz- ing an episode by the set of actions taken along with their outcomes. The revised representation of episode eV , along with four other episodes, is illustrated in Table2... ..."

Cited by 7

### Table 5 Estimates of factor loadings, error variances, and regression coefficients

### Table 1. Language of Fix!

2004

"... In PAGE 3: ...2 Language of Fix!. Table1 shows the syntactic entities of System Fix!, an ex- tension of F! by polarized kinds and xed-points of constructors. Typically, the empty context \ quot; will be suppressed.... ..."

Cited by 3

### Table 1: Fixed Parameters

2002

Cited by 63

### Table 1: Fixed Parameters

2002

Cited by 63

### Table 3. Performance of FIX

"... In PAGE 5: ... Number of solutions obtained by different proce- dures in Map-and-Fix Topologies By SP By LBM By FIX Logical Physical 14-node NSFNET 17 23 60 3-regular 14-node 21-link NSFNET 6 10 70 arbitrary 10-node 17-link Random 28 27 44 arbitrary To study the runtime of FIX, the number of iterations and the number of reroutings per iteration are recorded for each logical topology whose solution is obtained by FIX. The average number of iterations and the average rerout- ings per iteration for the three simulation scenarios are shown in Table3 . The averages are taken over all solutions that are obtained by FIX, i.... In PAGE 5: ...hat are obtained by FIX, i.e., solutions obtained by SM and LBM are not counted. Table3 shows that no more than 2 it- erations on average are needed to fix a non-survivable map- ping. And on average, no more than 3 reroutings are needed in one iteration.... ..."