### Table 1: Fixed points and stability conditions for com- petitive dynamics

"... In PAGE 3: ... Because the stability of each equilib- rium point changes depending upon the values of the parameters i and ji, we also computed a set of sta- bility conditions. The results of the analysis are shown in Table1 , revealing eight unique equilibrium points, corresponding to eight unique behaviors that can be generated by the agent. The stability analysis reveals three classes of stable solutions.... ..."

### Table 1: Runtimes (in sec) for performing thread operations. Note that Arachne exhibits com- petitive runtimes, even though context-switching cost grows as a function of stack depth).

1998

"... In PAGE 19: ... This command has a granularity of one millisecond, and returns the total time that a process spends with the CPU, ignoring context-switches and the execution of other processes. In Table1 we show the timings for the following three basic thread operations: 1.... ..."

Cited by 28

### Table 2: Summary of 50 runs of the final round of the 2003 RoboCup Coach Com- petition. Average goal differences are shown along with their standard deviations and overall ranking.

2005

Cited by 8

### Table 1: GP Parameters to Evolve a Binary Time Series Predictor Objective: Predict the next bit in the CEC-2006 binary time series prediction com- petition

2006

"... In PAGE 3: ... This included 41 tap points. See Table1 . However noticing that, except for the seventeenth and eighteenth, all of the first twenty tap points were included, we decided to include D17 and D18 regardless.... ..."

### Table 2: Summary of 50 runs of the final round of the 2003 RoboCup Coach Com- petition. Average goal differences are shown along with their standard deviations and overall ranking.

### Table 1: Overview of lower bounds (LB) and upper bounds (UB) on the com- petitive ratio of deterministic algorithms for on-line dial-a-ride problems

in information

"... In PAGE 3: ...reemptive version. These results are presented in Section 4. We notice that there is no difference between the preemptive version and the non-preemptive version of the problem if the server has infinite capacity, whence we inherit the matching lower and upper bound of 3 of the preemptive version for this case. An overview of the results is given in Table1 . For the exposition we have omitted to refer to [5] for the first 2-competitive algorithm... ..."

### Table 3: Probabilities (%) of winning the 1998 World Cup for di erent rank- ing schemes. The calculations were made at the end of the preliminary com- petition. A detailed description of the di erent rankings is given in the cap- tion of Table 1. The most likely winner apos;s probability is bold.

"... In PAGE 10: ...As the central question is to determine the new World Cup champion, Table3 shows the probabilities for each team participating in the France apos;98 nal competition to be crowned the best team on Earth. By looking at the FIFA and Elo rankings, Brazil would have won the tournament with proba- bility over 0:50.... ..."

### Table 5: Times spent on the task (hours)

"... In PAGE 9: ... The times that the first three authors spent on the task amounted to about 60, 100, and even 150 hours, respectively. Details can be found in Table5... In PAGE 10: ...nowledge discovery process. This also holds for the SAS approach. It was achieved with the comparatively lowest time investments (cf. last line of Table5 ) as could be expected from the SAS experts. SAS Mining Challenge 2002 [KFL+03] offered a task similar to the one in the new com- petition.... ..."

### Table VII shows the wall clock times taken by the systems, for each problem, in seconds. A point of interest here is that there is no problem that was solved by both CLIN-E and CLIN-S. Thus, although these two ATP systems are based on the same principle, they appear to have very di erent performance characteristics. 5. Conclusion This paper has presented the results of the CADE-13 ATP System Com- petition. In the General Hardware, Mixed Problems categories, the results show that: E-SETHEO gave the best overall performance in the category, by solving the most problems, having consistently higher scores over a large range of

1997

Cited by 8

### Table 1 presents the results of the final round of the TAC- 04/SCM competition. The top three agents were very com- petitive; all three had scores within a narrow range of less than $4M. These agents had much higher raw margins than the bottom three agents, and generally transacted more vol- ume in supplies and revenue. Among the top three, (small) differences in storage costs and raw margins determined the ordering. SouthamptonSCM had supply volume compara- ble to the top finishers, but high storage costs and low revenue indicate possible sales problems. Botticelli and Deep Maize both transacted substantially less volume than the top finish- ers.

2005

"... In PAGE 3: ...Table1 : Average scores for the TAC-04/SCM final round, along with more detailed breakdowns into the constituent components of the overall score.... ..."

Cited by 22