### Table 2: Computation time in msec for a Sun SPARC- station 10.

"... In PAGE 4: ... From this table, we see that MLM calculates 1=2 to 1=3 the number of Hu - man codes as Hu . Table2 shows that this results in signi cant speed-up (3.6X) for the high dynamic range knee image and moderate speed-up for the lower dy- namic range images (1.... ..."

### Table 1: Position of station K1 computed by Gauss-Jacobi combinatorial algorithm Exp

"... In PAGE 7: ... 16]. Example Using the data of [4, Table1 ] and the observational space angles for the network [e.g.... In PAGE 7: ...g., 8], the computed position of point 1 K in the experiment using the resultant optimization approach are given in Table1 with the deviations of the resultant optimization solutions from the true GPS value given in Table 2. In Figures 3 the deviation of the computed scatter of the distance Haussmanstr.... ..."

### Table 3. Average yields of soybeans from variety trials conducted in eastern Canada and climate variables .

"... In PAGE 13: ... Yield averages were adjusted for years with missing data using neighbouring trials as was done for corn. Data were obtained from Ontario Soybean Variety Trials Reports conducted by the Ontario Oil amp; Protein Seed Crop Committee, from the Canadian Soybean Coop Registration Trial Reports published by Eastern Cereal and Oilseeds Research Centre, Agriculture and Agri-Food Canada, Ottawa, and from some trial co- operators ( Table3 ). Statistics on farm level yields and production of soybeans are shown in Table 4.... In PAGE 23: ... b) Soybeans The relationship between average yields from soybean variety trials in eastern Canada and CHU is shown in Figure 14. Yields from trials on clay soils in southern Ontario were not included in the analyses, since these trials tended to yield lower than those on clay loam soils in the same area ( Table3 ). Although yields tended to increase linearly with CHU, the yield response to CHU was considerably lower than for corn.... ..."

### Table 1: Computational results (times in seconds are obtained on a DEC AlphaStation 500/400Mhz).

### Table 2 Pairs of stations Data

in complex

"... In PAGE 10: ... Figure 5a shows a great dispersion of the data while Figure 5b shows similar values for both stations, meaning that, in complex topography, the distance between stations cannot describe the differences between the radiation at different stations. Table2 shows the best lineal fit between the pairs of stations. The biggest differences in Figure 5 are found for values under 200 Wm-2.... In PAGE 19: ... Tables Table 1: Characteristics of the stations network. Table2 : Linear regression parameters computed based on the series in figure 5a and 5b. Table 3: Differences in the topographic parameters of the radiometric stations location measured in-situ and obtained based on the DEM.... ..."

### Table 1. States in Base stations agents

"... In PAGE 6: ... The communication between agents is assumed to occur through OAM cells in the ATM infrastructure as mentioned in [9]. The second task consists of building Table1 and then computing the weight for each channel when connection requests are received by base stations To compute the weight three parameters are needed : the channel priority, the channel position in the list and the number of neighbors that actually have the channel as part of their priority list. The formula used to compute the weight can be found in the algorithm description provided below where the channel at the top position in the list is privileged through the factor (4 - Position in the resource neighboring list).... ..."

### Table 3: Computational results on di erent classes of SDPs. Five instances with random data are considered for each class of the SDP. The computations were done on a Sun Ultra Sparc Station.

1996

"... In PAGE 36: .....K..M NT(Schur) NT(LS) Norm Minimization n = 100 m = 25 153:9 85:6 98:0 94:2 11:4 12:4 12:4 12:4 Chebyshev n = 100 m = 25 146:6 87:0 99:5 94:5 10:4 12:8 12:6 12:6 Max-Cut n = 50 m = 50 36:0 17:3 20:5 27:3 10:6 10:8 11:4 11:4 ETP n = 100 m = 100 68:1 65:3 44:2 51:0 14:8 27:2 17:0 17:0 Table 4: Same as Table3 but for Toeplitz-structured data. * The method based on the AHO direction fails on one of the instances due to step lengths going below 10?8.... ..."

Cited by 88

### Table 2. CSA results on 10 derived discrete and mixed problems with 20 runs per problem. (All runs are done on a Sun SparcStation Ultra 60 computer.)

1999

"... In PAGE 14: ...o find the best solution of 0.736554. Finally, EA was only able to find the best solutions in three of the ten problems despite extensive tuning. Table2 shows the results of applying CSA to solve derived discrete and mixed problems. It shows that CSA can find the best solutions with high success ratios (larger than or equal to 90% for every problem).... ..."

Cited by 28

### Table 3: Computational results for Gollan permutations (average values over 50 instances { SUN SparcStation 300 CPU times).

1999

"... In PAGE 12: ... (In fact, Kececioglu apos;s generator works on signed permutations: we simply ignore the signs of the permutation given on output.) Finally, Table3 reports the results for instances de ned as follows: for each n, we consider the Gollan permutation of n ele- ments (see [11]), its inverse, and permutations obtained by applying one random reversal to the Gollan permutation. Here the optimal solution value is known, being n ? 1 for the rst two permutations, and n ? 2 for the others.... ..."

Cited by 8

### Table 3: Computational results for Gollan permutations (average values over 50 instances { SUN SparcStation 300 CPU times).

1999

"... In PAGE 12: ... (In fact, Kececioglu apos;s generator works on signed permutations: we simply ignore the signs of the permutation given on output.) Finally, Table3 reports the results for instances de ned as follows: for each n, we consider the Gollan permutation of n ele- ments (see [11]), its inverse, and permutations obtained by applying one random reversal to the Gollan permutation. Here the optimal solution value is known, being n ? 1 for the rst two permutations, and n ? 2 for the others.... ..."

Cited by 8