### Table 2. Results for real word graphs derivations runtime

1994

"... In PAGE 6: ...erent factors: 0.001,0.01,1 and 10. Table2 shows the average numberof syntactic derivations andthe average runtime, the first one only given for correctly recognized sentences. The number of correct sentences when using prosodic information is given as n1 + n2, n1 sentences being part of the 145 sentences which were correctly recognized without using prosodic information.... In PAGE 6: ... The number of correct sentences when using prosodic information is given as n1 + n2, n1 sentences being part of the 145 sentences which were correctly recognized without using prosodic information. (Note that runtimes of Table 1 and Table2 can not be compared becausedifferent machines were used). As can be seenthe num- ber of correctly recognized sentences decreases and the runtime increaseswhen the factorwith which the prosodic information is taken into account increases.... ..."

### Table 6. Average results for real-world problem GRAPH 14

2004

Cited by 2

### Table 8: A comparison on real-world graphs from [43]. See text for details.

1999

"... In PAGE 31: ... 2, with up to 262,144 vertices and 1,059,331 edges. Table8 is derived from [43], where a recent comparison has been executed on the same graphs (times are on a SUN SuperSPARC61, Jostle [59] results are not shown be- cause they are dominated by Party, Scotch results are added). A value is in boldface if it is equal to the best value found by all techniques.... ..."

Cited by 19

### Table 1. Comparison of automata on random graphs and random amp; real formulas

2006

"... In PAGE 9: ...Experimental results Table1 shows the outcome of experiments performed to measure the effect of using SLBAs and TAs instead of TLBAs. The procedure described in [29] was used to generate 480 random 100-state Kripke structures and 360 ran- dom LTL formulas.... ..."

Cited by 1

### Table 1: Real-world benchmark graphs used in [43], see text for details.

### Table 1: The list of all possible marked packets arrived at the victim given that the real network graph is G1 in Figure 1.

2005

"... In PAGE 3: ... To illustrate, let us consider the network G1 in Figure 1 as an example. Table1 shows a complete set of all possible marked packets arrived at the victim. Let us take the last type of marked packets, i.... ..."

### Table 12: Sri Lanka: Determinants of the Private Savings Rate- Regression Results (1970-92)

1998

"... In PAGE 24: ... What has been the effect of this large aid inflow on saving and exchange rate in Sri Lanka? 26. Effect of foreign aid on private saving: Empirical analysis of the saving function is shown in Table12 . Using private national saving rate as the dependent variable, the regressors included growth of GDP, population growth rate (to represent the role of demographic factors) , a variable representing financial depth (deposit to GDP ratio) and the current account balance (to capture the impact of foreign saving).... ..."

Cited by 2

### Table 8: A comparison on real-world graphs from [43]. Results of existing techniques (top), results of Min-Max Greedy and RRTS (bottom). See text for details.

"... In PAGE 30: ... 2, with up to 262,144 vertices and 1,059,331 edges. Table8 (top part) is derived from [43], where a recent comparison has been executed on the same graphs (times are on a SUN SuperSPARC61, Jostle [59] results are not shown because they are dominated by Party, Scotch results are added). A value is in boldface if it is equal to the best value found by all techniques.... In PAGE 31: ... When a technique obtains the best result, the corresponding value is shown in boldface. Table8 (bottom part) shows the results obtained by Min-Max Greedy and RRTS on the same graphs, for BDBCBCD2 iterations, with the same setting used in Sec. 7, and for BDBCD2 iterations, with individual runs of D2 iterations (see Fig.... ..."

### Table 8: The average percentual errors between real and fitted values of the Rent characteristics obtained by random partitioning of the graphs.

"... In PAGE 46: ...5.1 Random partitioning Table8 lists the average absolute error in the logarithmic domain (in percent) for the fitting of the various theoretic models to the Rent characteristics obtained by random partitioning of the graphs. The first pair of groups comprises regular graphs; the other pair contains hypergraphs.... ..."

### Table 1: Structure of the annotated task-graphs For these annotated task-graphs we obtained a real-time systems, allocation, and scheduling optimal and feasible with respect to the corresponding constraint library. In

1996

Cited by 13