Results 11 - 20 of 7,256

Table 1. Approaches of ex

in Approaches of Wireless TCP Enhancement and A New Proposal Based on Congestion Coherence
by Chunlei Liu, Raj Jain 2003
Cited by 2

Table 1. Approaches of ex

in Approaches of Wireless TCP Enhancement and A New Proposal Based on Congestion Coherence
by Chunlei Liu, Raj Jain 2003
Cited by 2

Table 1. Approaches of ex

in Approaches of wireless TCP enhancement and a new proposal based on congestion coherence
by Chunlei Liu 2003
Cited by 2

Table 3. Number of ex-

in Mining Patterns from Structured Data by Beam-Wise Graph-Based Induction
by Takashi Matsuda, Hiroshi Motoda, Tetsuya Yoshida, Takashi Washio 2002
Cited by 1

Table 10. Ex

in Development of a Partially Bracketed Corpus with Part-of-Speech Information Only
by Hsin-Hsi Chen, Yue-Shi Lee 1995
Cited by 1

Table 6: Ex Number of

in Proceedings of the 2005 Winter Simulation Conference
by M. E. Kuhl, N. M. Steiger, F. B. Armstrong, J. A. Joines
"... In PAGE 7: ... From the results of the simulation, 19 trucks were used for 30 days. The expected value of the number of trucks needed to transport products from the factory to each distribution center is shown in Table6 , which can be compared to the resultant number of them obtained by performing simula- tion. The system described in this section was found to re- flect the real situation.... ..."

Table 1. Ex. 1:

in A Topology-Independent Fair Queueing Model in Ad Hoc Wireless Networks
by Haiyun Luo, Songwu Lu
"... In PAGE 9: ....e., each flow remains continually backlogged all the time. The throughput result for each flow is shown in Table1 . As expected, the algorithm achieves both long-term and short- term fairness and throughput guarantees.... ..."

Table 1. For Ex. 1

in A Multigrid Algorithm For The Cell-Centered Finite Difference Scheme
by Richard E. Ewing, Jian Shen
"... In PAGE 6: ...ote that all the solutions of our examples have the superconvergence results proved in [5], i.e., satisfying (4) with s = 2. In Tables 1 and 6, for example, the second row of Table1 means J + 1 = 3 level multigrid with hJ = 1 8, m; S1(1) means m = min (BJAJ) by S1(1) smoothers, and M; S1(1) means M = max (BJAJ) by S1(1) smoothers. From Table 1, we can see that even when I ? BJAJ fails to be a reducer, BJ may still be a good preconditioner.... In PAGE 6: ... In Tables 1 and 6, for example, the second row of Table 1 means J + 1 = 3 level multigrid with hJ = 1 8, m; S1(1) means m = min (BJAJ) by S1(1) smoothers, and M; S1(1) means M = max (BJAJ) by S1(1) smoothers. From Table1 , we can see that even when I ? BJAJ fails to be a reducer, BJ may still be a good preconditioner. In Tables 5{7, it is interesting to see the relations of the number of V -cycles (#V ), average contraction numbers (avc) and the time spent on the machine (cpu in seconds) when solving a xed problem on a xed grid by using di erent multilevels.... ..."

Table 2. For Ex. 1

in A Multigrid Algorithm For The Cell-Centered Finite Difference Scheme
by Richard E. Ewing, Jian Shen

Table 6. For Ex. 2

in A Multigrid Algorithm For The Cell-Centered Finite Difference Scheme
by Richard E. Ewing, Jian Shen
Results 11 - 20 of 7,256