### Table 4: Performance results using the same strategy for all documents, measuring the total turnaround time (TaT), the number of stale documents that were returned, and the total consumed bandwidth. Optimal and near-optimal values are highlighted for each metric.

2002

"... In PAGE 11: ...1 Applying a Global Strategy In our first experiment each document was assigned the same strategy. The results are shown in Table4 .... In PAGE 11: ... Combining SU50 with a caching strategy for the remaining intermediate servers improves the total turnaround time, but also leads to returning stale documents. Table4 also shows that most strategies are relatively good with respect to one or more metrics, but no strategy is optimal in all cases. In the next section, we discuss the effects if a global strategy is replaced by assigning a strategy to each document separately and show that per- document replication policies lead to better performance with respect to all metrics at the same time.... In PAGE 13: ... Because we assume that a lower value in a metric always indicates a better performance, using result vectors introduces a partial ordering on the complete set A of arrangements, such that totala3 A1a6 a10a9 totala3 A2a6 iff a11 i a0 a0 1a4 a7 a7 a7 a4 N a1 : totala3 A1a6 a3a2 ia4a13a12 totala3 A2a6 a3a2 ia4 and a14 j a0 a0 1a4 a7 a7 a7 a4 N a1 : totala3 A1a6 a3a2 ja4 a9 totala3 A2a6 a3a2 ja4 Obviously, if totala3 A1a6 a10a9 totala3 A2a6 then A1 should be considered to be better than A2 as it leads to better performance values for each metric. As an example, consider the results from Table4 for FAU Erlangen. Let ACV be the arrange- ment in which each document is assigned strategy CV, ACLV be the arrangement with CLV and ACDV be the one with CDV for each document.... ..."

Cited by 45

### Table 4: Performance results using the same strategy for all documents, measuring the total turnaround time (TaT), the number of stale documents that were returned, and the total consumed bandwidth. Optimal and near-optimal values are highlighted for each metric.

"... In PAGE 11: ...1 Applying a Global Strategy In our first experiment each document was assigned the same strategy. The results are shown in Table4 .... In PAGE 11: ... Combining SU50 with a caching strategy for the remaining intermediate servers improves the total turnaround time, but also leads to returning stale documents. Table4 also shows that most strategies are relatively good with respect to one or more metrics, but no strategy is optimal in all cases. In the next section, we discuss the effects if a global strategy is replaced by assigning a strategy to each document separately and show that per- document replication policies lead to better performance with respect to all metrics at the same time.... In PAGE 13: ... Because we assume that a lower value in a metric always indicates a better performance, using result vectors introduces a partial ordering on the complete set A of arrangements, such that totalB4A1B5 BO totalB4A2B5 iff BKi BE CU1BNBMBMBMBNNCV : totalB4A1B5CJiCL AK totalB4A2B5CJiCL and BL j BE CU1BNBMBMBMBNNCV : totalB4A1B5CJ jCL BO totalB4A2B5CJ jCL Obviously, if totalB4A1B5 BO totalB4A2B5 then A1 should be considered to be better than A2 as it leads to better performance values for each metric. As an example, consider the results from Table4 for FAU Erlangen. Let ACV be the arrange- ment in which each document is assigned strategy CV, ACLV be the arrangement with CLV and ACDV be the one with CDV for each document.... ..."

### Table 3: Results on ten 10x10 instances of the JSSP with strategy (c) 3 An Approximation Algorithm The results obtained by the optimization algorithms are quite good. However, the overall CPU time varies a lot from one instance to the other. By examining a number of runs more closely, we found two explanations for that. First, the dichotomizing strategy may lead to proving several times the quasi-optimality of a solution. Second, and more surprisingly, we found that a signi cant portion of the CPU time is spent nding solutions relatively far from the optimal value. For example, on the MT10 instance, strategy (a) spends nearly half of the total CPU time nding a schedule of makespan 968, while the optimal value 6

1995

"... In PAGE 5: ... Table 2 gives the results obtained by always selecting an activity to execute last. Table3 gives the results obtained by dynamically deciding between rst and last. In both cases, a binary search that dichotomizes on the possible values of the makespan is used.... ..."

Cited by 20

### Table 1 Mapping strategies

"... In PAGE 4: ...4. Mapping strategies Table1 describes the four mapping strategies tested. The unmapped partition com- pletely ignores the processor topology to give a near optimal partition for a uniform topology as in Figure 1(c).... ..."

### Table 3. Bit count of Caseau and near optimal coloring for different balanced hierar- chies

1997

"... In PAGE 10: ...04 Table 2. Hierarchy characteristics Table3 shows the main result, the number of bits needed for the encoding using three different splitting strategies combined with two different coloring strategies. The first two columns show the number of genes needed for encod- ing the original hierarchy.... ..."

Cited by 15

### Table 3. Bit count of Caseau and near optimal coloring for di erent balanced hierarchies

"... In PAGE 12: ...04 Table 2. Hierarchy characteristics Table3 shows the main result, the number of bits needed for the encoding using three di erent splitting strategies combined with two di erent coloring strategies. The rst two columns show the number of genes needed for encod- ing the original hierarchy.... ..."

### Table 3. Bit count of Caseau and near optimal coloring for di#0Berent balanced

1997

"... In PAGE 12: ...04 Table 2. Hierarchycharacteristics Table3 shows the main result, the number of bits needed for the encoding using three di#0Berent splitting strategies combined with two di#0Berent coloring strategies. The #0Crst two columns show the number of genes needed for encod- ing the original hierarchy.... ..."

Cited by 15

### Table 3. Optimal k-Values with R, Q and MSE for the CC Strategy

"... In PAGE 26: ... Second, removing a certain percentage of data from two data sets with different numbers of attributes but the same number of cases would result in different numbers of complete cases. Table3 and Table 4 show the observed optimal k-values for the CC strategy and the IC strategy, respectively, given the average number of complete cases for the simulated percentages. It can be seen that the optimal value of k for a certain number of neighbours is the same regardless of strategy.... In PAGE 29: ... The diagram (for six attributes) can be seen in Fig. 5 (for the raw numbers, see Table3 and Table 4). Both neighbour strategies provide nearly maximum ability (R) up to around 30% missing data (when, on average, 88% of the cases are incomplete).... ..."

### Table 2. Optimization strategies

1999

Cited by 6