### TABLE 1 Output of beta for each of the 16 diploid types of E. coli*

### TABLE I. Average relative phase (6SD) between peak response and tone onset*

### TABLE 6: Theoretical IR Intensities (I)ofC60 and C606- in km/mola

### Table 2: Distribution of Correspondences

1995

"... In PAGE 3: ... These were usedas a starting point for the manualassign- ment of correspondences made in the second pass. Table2 shows the distribution of the correspondencesin the training corpus.... In PAGE 3: ... It is thus limited by the drawbacksof text excerpting and the highest performance attainable is the sum of all direct sen- tence matches and all direct joins. Referring to Table2 this is: 451 + 19 568 = 83% A sentence produced by the summarizer is defined as correct here if: 1. It has a direct sentence match, and is present in the manual summary.... ..."

Cited by 256

### TABLE II EXHAUSTIVE ENUMERATION OF ALL 16 POSSIBLE AGENT PAYOFFS, gfi(x = 1);gfi(x = 2), FOR BOUNDEDLY INTELLIGENT OPPONENTS HAVING INTELLIGENCE PARAMETER fi = 1=4, fi = 2=4, fi = 3=4, AND fi = 4=4. SEE TABLE I FOR THE CORRESPONDING f FUNCTIONS AND FOR THE fi = 1 g FUNCTION. THE PAYOFF FUNCTIONS LABELLED IN BOLD ARE THOSE CONSISTENT WITH THE POPULATION d2 = f(1;2;1=2);(2;2;1)g.

### TABLE II EXHAUSTIVE ENUMERATION OF ALL 16 POSSIBLE AGENT PAYOFFS, gfi(x = 1);gfi(x = 2), FOR BOUNDEDLY INTELLIGENT ANTAGONISTS HAVING INTELLIGENCE PARAMETER fi = 1=4, fi = 2=4, fi = 3=4, AND fi = 4=4. SEE TABLE I FOR THE CORRESPONDING f FUNCTIONS AND FOR THE fi = 1 g FUNCTION. THE PAYOFF FUNCTIONS LABELED IN BOLD ARE THOSE CONSISTENT WITH THE SAMPLE d2 = f(1;2;1=2);(2;2;1)g.

### Table 13 presents the running times for Ocean on the iPSC#2F860, Table 14 presents the running times on DASH. The COOL version is an explicitly parallel version written in the concurrent object-oriented language COOL#5B8#5D. Figures 26 and 27 present the corresponding speedup curves.

"... In PAGE 23: ... Table13 : Execution Times for Ocean on the iPSC#2F860 #28seconds#29 1 2 4 8 16 24 32 Jade 104.13 99.... ..."

### Table 4: Comparison between CES and FES on f14{f23. The results were averaged over 50 runs. \Mean Best quot; indicates the mean best function values found in the last generation. \Std Dev quot; stands for the standard deviation.Function Number of FES CES FES?CES Generations Mean Best Std Dev Mean Best Std Dev t-test

1997

"... In PAGE 9: ....3.3 Multimodal Functions With a Few Local Minima (f14{f23) The evolutionary processes of FES and CES on functions f14{f23 are shown by Figures 6, 7 and 8. The nal results are summarised in Table4 . Although these functions are also multimodal functions, the behaviour of FES and CES on them are rather di erent from that on multimodal functions with many local minima.... ..."

Cited by 26

### Table 1: Number of iterations required to nd an optimal solution using the previous solution as a starting point and using the vector (0; : : : ; 0) as a starting point.

2001

"... In PAGE 24: ... When a new user enters the system, running the MFVA algorithm using as a starting point the optimal solution for the problem prior to the new user apos;s arrival typically results in substantial computational savings. Table1 shows results from a power control problem involving a system of ten by ten cells and approximately nine hundred mobile users. The number of iterations required to nd the optimal solution for an initial problem is given, along with the number of iterations required to nd the optimal solution when additional users enter the system.... ..."

Cited by 10

### Table 1: Numberofiterations required to nd an optimal solution using the previous solution as a starting

2001

"... In PAGE 24: ... When a new user enters the system, running the MFVA algorithm using as astarting point the optimal solution for the problem prior to the new user apos;s arrival typically results in substantial computational savings. Table1 shows results from a power control problem involving a system of ten bytencells and approximately nine hundred mobile users. The number of iterations required to nd the optimal solution for an initial problem is given, along with the numberofiterations required to nd the optimal solution when additional users enter the system.... ..."

Cited by 10