### Table 4: Results for 20-30 instance examples

2002

"... In PAGE 4: ...able 3: Results for 10 instance examples .............................................................................................................9 Table4 : Results for 20-30 instance examples .... In PAGE 14: ... For Ex7, Ex8, and Ex10, each instance can depend on any close instances, but can depend on only one un-close instance. Table4 shows that the average Added dependency for the constructive algorithm is 70%, while for ASAP algorithm is 128%. Although Added dependency of constructive algorithm is much better than ASAP algorithm, they are much worse than the results for 10 instance behaviors.... ..."

Cited by 2

### Table 1. Timings for di erent solve methods n 10 20 30 40 50 60 70 80 90 100

1999

"... In PAGE 16: ...xpected. With Equation (2.6) we can now build one antidi erence G(k) for all n 2 N0. Our procedure qgosper can do all the necessary calculations: gt; assume(n,posint); gt; qgosper(qpochhammer(a,q,k)/qpochhammer(q,q,k)/(a*q^n)^k,q,k,series=true); ? ? 1 + qk a qn qpochhammer(a; q; k) ?a qn k qpochhammer(q; q; k) n X i=0 0 B B @ qpochhammer?q?n; q; i q i ?qk i ?a qn ? q i qpochhammer q?n a ; q; i 1 C C A Note that after 2 s qgosper delivers an antidi erence for all n 2 N. This should be compared with the timings in Table1 . The declaration assume(n,posint); helped the procedure qgosper to determine that the sum is not in nite since the summand is zero for i gt; n.... ..."

Cited by 8

### TABLE 2 Task Requirements Tasks: 6; Processors:3 T = GCD[10; 20; 30; 20; 30; 60] = 10 D = LCM[10; 20; 30; 20; 30; 60] = 60 Task No.

### TABLE 4 Tasks:6; Processors: 3 T = GCD[10; 20; 30; 20; 30; 60] = 10 D = LCM[10; 20; 30; 20; 30; 60] = 60 Task No.

### Table 2. Estimates for two-factor polynomials. f 10 20 30 f 10 20 30

1996

Cited by 1

### Table 1. Profiles of different 20/30-queries workloads with no selections. Unchanged parameters in gray.

"... In PAGE 5: ... The limited cardinality allows the optimization algorithms to be applied without pre-reducing the number of queries to be considered. Table1 shows workloads characterized by no selections and different profiles for the indicators relative to materialization. It is evident that the number of candidate views, and thus the complexity of view materialization, mainly depends on the values of ASK and is slightly more influenced by AAL.... ..."

### Table 2 and Fig. 6 and show that images in CIF resolution are very well representable with 20{30 codebook entries.

"... In PAGE 8: ...Table2 . Subjectiveevaluation of test images in CIF resolution with quantized chrominance.... ..."

### Table 1. Average precision values at 5, 10, 20 and 30 images.

2003

"... In PAGE 8: ...ig. 4. Recall Precision with and without using the temporal events. Table1 presents average precision values at top 5, 10, 20 and 30 photos for the 26 queries. The values in parentheses indicate the relative increase.... ..."

Cited by 1

### Table 4. Results of tabu search in problems with 10, 20 and 30 nodes

"... In PAGE 11: ... Comparison of tabu search with different tabusize Table 3. Comparison of tabu search with different Nmax In Table4 , for the problems with 10, 20, and 30 nodes, the computational results of tabu search are shown with a recency based short term memory, a frequency based long term memory and optimal solution. In the table, optimal solutions are obtained by solving each integer problem by running the CPLEX solver9.... In PAGE 11: ... We note that the computational running time for the tabu search increases linearly as the number of nodes gets larger, but the computation time by CPLEX increases exponentially. Table4 . Results of tabu search in problems with 10, 20 and 30 nodes Table 5 shows the computational results of tabu search in problems with 40 and 50 nodes.... ..."

### Table 2. Precision at 20, 30, 50, and 100 documents.

"... In PAGE 23: ... 23 To be more precise about the results for low recall values, Table2 presents the average precision values at 20, 30, 50, and 100 documents for the VK, CG and integrated approach. We chose these recall points comes from the fact that for image retrieval, the system is able to present 20 or 30 image thumbnails per page (or screen), and browsing a set of 50 or 100 images is not too painful for users (for instance, the well known Google web retrieval system (http://www.... In PAGE 23: ...If we analyse the results of Table2 according to numbers of relevant documents, we notice that at 20 documents the recall value is increased by around 3%; so there is around 0.6 more document retrieved on 20 compared to the VK results.... ..."