### Table 2. Quantitative measures of model performance of straight line (SL) and random walk (RW) models for Ateles.

2001

### Table 3. Quantitative measures of model performance of straight line (SL) and random walk (RW) models for Cebus.

2001

### TABLE III MEAN RISK AND RETURN OVER THE 37 INTERNATIONAL INDICES. RESULTS SHOWN FOR THE EXTREME AND MID ARCHIVED ENNS THE MARKET PERFORMANCE AND FROM THE RANDOM WALK MODEL (STANDARD DEVIATIONS IN PARENTHESIS).

2005

Cited by 4

### Table 3 Random Walk Simulations

1998

"... In PAGE 16: ...1. Random Walk Process The results for the random walk process are reported in Table3 for the p-values18 of all currency pairs. The methodology of this paper places a historical realization in the simulated distribution of the performance measure under the assumed process and calculates its one-sided p-value19.... ..."

Cited by 2

### Table 1 shows the NDE bound results for the PlanetLab models at significance level 5% where ns was set to 1000. The random walk row displays the errors in proportion to the true value observed, calculated as

"... In PAGE 4: ...98% with the longer horizon forecasts performing worse. From the NDE statistic bounds for the ARIMA(1,1,0) and EWMA rows in Table1 we can conclude that the ARIMA(1,1,0) model generates predictions on par with the random walk model, for one and two-step-ahead predic- tions, and better at significance level 5 per cent for three- step-ahead forecasts. The EWMA model performs better for longer forecasts but not at a significant enough level to pass our test.... In PAGE 4: ... The Ty- coon network currently comprises about 70 hosts. Usage Table1 . PlanetLab Model NDE Bounds at 5% Sig- nificance Level with Random Walk (RW), Exponentional Smoothing (EWMA) and ARIMA(1,1,0) models, using 1,2 and 3-step ahead (SE) Forecasts.... ..."

### Table 1: Random walk model residuals.

### Table 22: The distance distribution for Random Walk model

### Table 22: The distance distribution for Random Walk model

### TABLE II PERFORMANCE OF SEARCHING WITH 1-STEP REPLICATION.

2005

Cited by 33

### Table 3 - Performance of Adding walks

2002

"... In PAGE 12: ... This means we are exploring the group lt;P gt; for matching terms in a very random way, so we should see results similar to the random case. The question now is: What is the ideal value of r? Table3 shows the performance of the Pollard Rho ... In PAGE 12: ...Table 3 - Performance of Adding walks Table3 shows us that Adding walks not only perform as well as random walks, but they perform better for large values of r. In the first trials, when r is small, the algorithm performs quite poorly, especially when r = 3.... ..."