### TABLE IV Performance ofthe varianceestimation method in a modified sequential procedure.

### Table 3: Performance of the variance estimation method in a sequential procedure

### Table 4: Performance of the variance estimation method in a modified sequential procedure.

### Table 1: Time costs of the procedures in the sequential BH algorithm Procedure Time

"... In PAGE 7: ... To measure the relative cost of each step in the sequential BH algorithm, a number of runs were performed to estimate the efficiency of the sequential BH algorithm and the fraction of time each step of the algorithm takes. In Table1 we show the time costs of the main steps of the sequential BH algorithm when run on a single workstation for 16,000 particles and 1000 time steps. As the Table 1 shows, most of the computation is incurred by CalcForces procedure which is about 96% of the total execution time of the algorithm.... In PAGE 7: ... In Table 1 we show the time costs of the main steps of the sequential BH algorithm when run on a single workstation for 16,000 particles and 1000 time steps. As the Table1 shows, most of the computation is incurred by CalcForces procedure which is about 96% of the total execution time of the algorithm. This alerts us that performance optimization techniques should focus on this step.... In PAGE 19: ... 61 3.4 Tree Traversal once for each processor domain From the run time cost analysis of the BH algorithm shown in Table1 , the CalcForces procedure takes more than 96% of the total run time of the algorithm. So, one of the ways to optimize the algorithm is to optimize the CalcForces procedure.... ..."

### Table 4: The Sequential Heuristic Procedure procedure SequentialHeuristic (AS) CU while not all orders are assigned CU

2001

Cited by 3

### Table 3: A comparison of the expected outcomes for the three multi-issue procedures for the sym- metric information setting (for the sequential procedure, ts c denotes the start time for the

Cited by 1

### Table 4: A comparison of the expected outcomes for the three multi-issue procedures for the asym- metric information setting (for the sequential procedure, ts c denotes the start time for the

Cited by 1

### Table 3: A comparison of the expected outcomes for the three multi-issue procedures for the sym- metric information setting (for the sequential procedure, ts c denotes the start time for the

Cited by 1

### Table 4: A comparison of the expected outcomes for the three multi-issue procedures for the asym- metric information setting (for the sequential procedure, ts c denotes the start time for the

Cited by 1

### Table 1. Total time (in seconds) and number of representatives m obtained at different partitioning thresholds (r) used in the sequential sampling procedure. r2

2006

"... In PAGE 6: ...2, the leading eigenvectors have a better approximation than the trailing ones. Table1 shows the total time taken by our method on using different partitioning thresholds r in the se- quential sampling procedure. The number of represen- tatives/clusters (m) obtained is also shown.... ..."

Cited by 2