### Table 2 This table shows the number of iterations, the total time T , the preprocessing time Tpre,and the time to select the independent set Tis as a function of the number p of processors and the target size k of the independent sets.

1999

"... In PAGE 9: ... 5 Summary of Experimental Results We now summarize our experimental results. The results reported in Table2 are for runs with no limit on the number of nodes touched and no limit on the degrees of nodes included in the independent sets. These parameters maximize parallelism at the possible expense of the quality of the ordering.... ..."

Cited by 5

### Table 2 This table shows the number of iterations, the total time T, the preprocessing time Tpre, and the time to select the independent set Tis as a function of the number p of processors and the target size k of the independent sets.

"... In PAGE 9: ... 5 Summary of Experimental Results We now summarize our experimental results. The results reported in Table2 are for runs with no limit on the number of nodes touched and no limit on the degrees of nodes included in the independent sets. These parameters maximize parallelism at the possible expense of the quality of the ordering.... ..."

### Table 3.4: This table shows the number of iterations, the total time T , the preprocessing time Tpre, and the time to select the independent set Tis as a function of the number p of processors and the target size k of the independent sets.

2001

### Table 1: Summary of Notation entry events in [t; t + A), the joint distribution of their times in [t; t + A) is identical to that of k independent [t; t + A] uniform random variables (Ross 1983, pg. 37). Choosing one of these k uniformly at random, the probability that its arrival message lies outside of [t; t + A) is given by PrfArrival message time for service entry event gt; t + A j S = kg = Z t+A

"... In PAGE 8: ...ess than A. Let ai;k denote the mean fraction of generation i messages that have rank k. Letting ~ fk(s) be the density function for an Erlang-k conditioned on being less than A, we approximate the arrival time density function of an arbitrary generation i message as the mixture t + P1 k=2 ai;k ~ fk(s). Table1 summarizes our notation. All random quantities are LP-oriented, rather than system-oriented.... ..."

### Table 1: Polywheels and graph homology

"... In PAGE 13: ... For k = 1, 2, and 3 this gives us k independent equations in k unknowns (the Chern numbers) which we can invert. Then according to the relations in Table1 , all the Rozansky-Witten invariants may be determined from this information. When k = 4 we get four independent equations in ve unknowns, and hence we cannot determine all of the Chern numbers, let alone the Rozansky-Witten invariants, from what we know thus far.... In PAGE 13: ... For = , c is a linear expression in k (as proved in [12]), and using our calculations for k = 1, 2, and 3 we can determine this expression precisely. Substituting into Equation (5) gives us the following results b k(S[k]) = 12k(k + 3)k (9) b k(Kk) = 12k(k + 1)k+1: (10) From Table1 we can see that b 4 is a characteristic number. Therefore when k = 4 we get a fth equation for the Chern numbers which we can combine with the four independent equations we already have, and this system can then be solved to give all of the Chern numbers.... ..."

### Table 2. Number of land cover types retained at each level of aggregation for seven landscapes.

"... In PAGE 5: ... These re- sults (Table 1) apply only if k is independently and randomly distributed on the landscape. Although this condition will seldom be satisfied exactly, the general pattern holds for a variety of actual land- scapes ( Table2 ). At increasingly coarser scales of resolution, cover types with a small P,(l) dis- appear.... In PAGE 7: ... The dominance and contagion indices both de- pend on a maximum value, which is determined by m, the number of land cover types present. The number of land cover types observed decreases as resolution becomes increasingly more coarse and rare cover types disappear ( Table2 ). Indices D and C are sensitive to loss of cover types, and break points occur when the indices are plotted against grain (Fig.... ..."

### Table 5. Results with the quantitative approach

2003

"... In PAGE 15: ...8. Table5 reports the results of four difierent experiments. The results of these experiments conflrm those obtained with the qualitative algorithm.... In PAGE 17: ...ny semantics. Figure 5 shows an example of such a random graph. The results of the experiments showed that new cycles increase signiflcantly the number of iterations. For instance, applying the quantitative algorithm to the graph showed in Figure 5, the number of iterations for the last three experiments presented in Table5 (Exp2, Exp2, and Exp3) increased from 6 to 33, from 6 to... ..."

Cited by 17

### Table 1. A new exact algorithm for the computation of the chromatic number of a graph G.

"... In PAGE 3: ...- 3 - A description of the new exact algorithm is given in Table1 . We have used the following notations.... ..."

### Table 1: Comparison of algorithmic and algebraic graph replacement approaches

1997

"... In PAGE 40: ... We will use this framework over here for reviewing a number of di erent context sensitive graph replacement approaches (cf. Table1 in Subsection 4.5).... In PAGE 62: ...way for the work presented here. Furthermore, thanks to the two anonymous referees of this chapter for their helpful comments on a previous version, to An- dre Speulmanns for producing a rst version of Table1 (comparison of graph replacement approaches), and to Alexander Bell for his excellent Framemaker to LATEX compiling job. References 1.... ..."

Cited by 31

### Table 5-1 Current approach vs New approach

2005

"... In PAGE 65: ... However, once they are developed, they can be applied to other studies with little additional development time. In Table5 -1 is shown a comparison between the current process and the one used in this thesis. As shown in Table 5-1 the new approach takes a bit more time in the modeling set up for the first model than the current approach.... In PAGE 65: ... In Table 5-1 is shown a comparison between the current process and the one used in this thesis. As shown in Table5 -1 the new approach takes a bit more time in the modeling set up for the first model than the current approach. However, it took ~ 40 % of the current approach to generate nine models and review them.... ..."

Cited by 1