### Table 1: Nested Loop Algorithm R

"... In PAGE 3: ... PROCESSOR PARALLELIZATION The increase in velocity of processing is also achieved by parallelizing the node computations. From the basic equations of algorithm R ( Table1 ), in which we do the following substitution: n = Pk ? p donde 0 p P ? 1, k 2 Z, a set of P equations can be obtained that allow computing of P nodes in the same time k: Am j (Pk ? p) Dm j (Pk ? p) = 1 km ?km 1 Am?1 j (Pk ? p) Dm?1 j (Pk ? (p + 1)) If we de ne : Am;p(k) Dm;p(k) = Am(Pk ? p) Dm(Pk ? p) we can obtain the structure of the lattice stage m gt; 0 in Fig.5(a).... ..."

### Table 3: Estimation of A, Q and R for di erent lattice sizes.

1993

"... In PAGE 3: ... We used 11 scales, with L = 0 the coarsest and M = 10 the nest. E ects of Data Length In Table3 we compare the estimation results for di er- ent numbers of scales and di erent numbers of observa- tions at the nest scale. The estimation error decreases when the number of scales and the number of observa- tions at the nest scale increase from 9 and 256 to 11 and 1024 respectively.... ..."

Cited by 1

### Table 6. nested flag

"... In PAGE 7: ....2. Nested Flag The nested flag contains a flag assignment that occurs when two conditions are both satisfied. Table6 shows the programs and fitness landscapes related to this test object. The fitness landscape of the original program consists of a single plateau with one hole at the optimum position [0, 0] for target A.... ..."

### Table 6: Nested iteration

1998

Cited by 3

### Table 1: Lattice Diagrams versus Lattice Circuits.

"... In PAGE 6: ... First results were presented in [6]. In Table1 we show the advantages of the proposed Lattice Circuits to previous best results for Lattice Diagrams. The dynamic approached is used for the variable ordering.... ..."

### Table 1: Lattice Diagrams versus Lattice Circuits.

"... In PAGE 6: ... First results were presented in [6]. In Table1 we show the advantages of the proposed Lattice Circuits to previous best results for Lattice Diagrams. The dynamic approached is used for the variable ordering.... ..."

### TABLE III HEXAGONAL LATTICES VS. RECTANGULAR LATTICES

### Table 2 Lattice for RTA

2001

"... In PAGE 6: ... RTA can also be thought of as an analysis to determine which parts of the program may be exercised during execu- tion, and it is often used for this purpose (eg, [29, 23]). The lattice in Table2 is designed from this perspective, and the D1D3D2D3D8D3D2CXCRBVCWCPD2CVCTB4DABCBN DAB5 predicate can be defined as the greater-than (BQ) relation for use with these values. Table 2 Lattice for RTA... ..."

Cited by 5