### Table 1: Feasible rate per slot as function of SNR.

2001

"... In PAGE 28: ...0 dB, respectively. The feasible rates per slot then follow from Table1 using fading realizations as shown in Figure 8. The throughput target for user 2 is set twice as large as for users 1 and 3, i.... ..."

Cited by 57

### Table 1: Feasible rate per slot as function of SNR.

2001

"... In PAGE 28: ...0 dB, respectively. The feasible rates per slot then follow from Table1 using fading realizations as shown in Figure 8. The throughput target for user 2 is set twice as large as for users 1 and 3, i.... ..."

Cited by 57

### Table 3. Baseline unicluster architecture Function Units Issue slots Latency

2003

Cited by 16

### Table 8: The blocking probability Bi, i and i;2 as a function of the number of slots k0

"... In PAGE 17: ... Consequently the rate i at which slot requests arrive has to increase by a factor f in order to ensure the same amount of application data is transmitted. Table8 shows the blocking probability Bi, i and i;2 as a function of the number of slots k0. The rst thing to observe is that Bi shows a minimum for k0 = 7 whereas i;2 is increasing with k0.... ..."

### Table 3.1: Transmission rate per slot as a function of SNR

### Table 1. Algorithm in pseudo-code for function WTA(Wavelength channel and Time slot Assignment)

in cope

1999

"... In PAGE 10: ... Finally, the connection is removed from the set of connections that are not assigned a time slot and a wavelength channel, and the construction loop is started again. Table1 speci es the algorithm in pseudo-code. Function feasible-connections determines the set of connections that are compatible with the current time slot byevaluating the constraints speci ed in the question part of the problem de nition.... ..."

### Table 2.5 Simulated characteristic impedance of longer contact pads shown in Figure 2.16. Values are listed as a function of the ground slot and the dielectric constant of SU8.

### Table 4 provides a list of the additional default own slots for all relation and function frames with their mapping to MOF and UML and related type.

"... In PAGE 31: ... Table4 . Default Own Slots for Relations and Functions.... ..."

### Table 1: The transfer function for the and C function for strings of one bit. The empty slots indicate cases which can never arise.

2000

"... In PAGE 5: ... To compute on longer strings we apply it bitwise. Table1 gives the definition for individual bits. To apply the and function to arbitrary strings in L, the shorter string is sign- extended to the length of the longer one before we apply the operation bitwise.... ..."

Cited by 43

### Table 1: The transfer function for the \and quot; C function for strings of one bit. The empty slots indicate cases which can never arise.

2000

"... In PAGE 5: ... To compute on longer strings we apply it bitwise. Table1 gives the de nition for individual bits. To apply the \and quot; function to arbitrary strings in L, the shorter string is sign- extended to the length of the longer one before we apply the operation bitwise.... ..."

Cited by 43