### Table 3: Computational results for the maximum lateness

"... In PAGE 4: ... In Table 2 the results obtained for the mean flow time minimization problem are shown in the same form as above, but optimum is replaced by the best solution known [3]. In Table3 the results for the maximum lateness minimization problem are presented [4]. In this case only the number of best solutions found is given, where the number of instances generated for m =2, 3 and 4 machines is equal to, respectively: 21, 14 and 7.... ..."

### Table 2: The times assigned by the di erent agents to each reader (1st iteration - in minutes; ST - Start Time; FT - nish Time; SLK - slack) Each Operational Agent is responsible for locally optimising the schedule proposed by the Resource Tac- tical Agent. The algorithm provided to each Opera- tional Agent minimises maximum lateness of the jobs longest path from the source node (S) to that node.

1994

"... In PAGE 5: ... In the new assignment performed by the OAsco1, Nel- son reads the Scotsman at 585, instead of 607 as pro- posed by the RTA, and the reader Flavio reads the Scotsman at 595, instead of 590 as proposed by the RTA. Table2 displays the di erent times assigned to each operation by each agent. The other RTAs (and OAs) associated with the other newspapers schedule their readers using a scheduling process identical to the one described for the Scotsman.... ..."

Cited by 5

### Table 4.1 A set of independent tasks The schedule is optimal, which is not true in general when the maximum lateness is under consideration. 19/2/1994 17:41|PAGE PROOFS for John Wiley amp; Sons Ltd (using jwcbmc01, Vers 01.02 OCT 1993)|bonas

### Table 2 shows the maximum workloads per sample for calcu- lating the filter coefficients, i.e. the filter operations to calculate the prediction are not considered. In the GAL the prediction order D4 has the greatest influence on the complexity. In this method for each sample D4 divisions are required which are very expensive on a DSP. Notice that in the Burg algorithm the maximum workload is only influenced by the block length C6 which is also the case in the autocorrelation method for long blocks.

2000

"... In PAGE 3: ... Table2 : Maximum workload per sample for coefficient cal- culation. 4.... In PAGE 4: ... 53 dB for the piano and 23 dB for the triangle, which are upper bounds for the achievable prediction gains [11]. Figure 3 shows the obtained segBZD4values dependent on the ma- ximum DSP workload per sample given in Table2 . For the block- based methods the plots show lines for constant values of the pre- diction order D4.... ..."

Cited by 2

### Table.1 shows quantitative results of each estimated command set. The Error means the mean squared error in comparison with ideal F0 contour, and the Score means the F0 reliability score. Here, the F0 reliability score is the ratio of the accumu- lated F0 reliability to the accumulated maximum F0 reliability, so it is defined as

### Table 1. Temperature differences between heated and cool sides.

"... In PAGE 7: ...esigner). The time t is counted from the instant Hyper-X is separated from the Pegasus booster rocket. Figures 7 and 8 are plots of the temperature profiles along the depth of the window at different time steps. Table1 lists the temperature differences between the heated and cool sides at different times. As will be seen later, the highest value of does not necessarily induce the highest tensile stresses.... ..."

### Table 2. Transitions of relevant early- and late-time molecules with the estimated line strength relative to the CS (J=1-0) line intensity, at the time of reaching maximum abundance. Calculations have been made assuming LTE, Tex=10 K and a line width V=1 km s?1

### Table 3 shows the estimated maximum forwarding rate and available per-packet processor cycles for 64- byte and 1500-byte packets calculated from the best push rates in Table 2. The round trip rate is calcu- lated as one-half the harmonic mean of the memcpy- based host push rate and the DMA-based card push rate. We estimate the available Pentium III cycles as the number of cycles that pass while the card is trans- ferring the data to the host.

2000

"... In PAGE 10: ... Table3 : Estimated Maximum Forwarding Rate and Available Per-Packet Processor Cycles. Packet Round Trip Available Pentium III Bytes Kpps Cycles @ 733MHz 64 183.... ..."

Cited by 23

### Table 4: maximum difference of worst delay.

"... In PAGE 8: ... Six timing runs are done: the exact multiple signal method (E), the latest arriving method (late), the max slew method (S), the full envelope method (F), the half envelope method (H), and the upper bound method (U). Table4 list the maximum difference of worst-case delay at primary outputs between the last five methods and the exact method. The latest arriving method gives too optimistic timing in the case of circuit c432.... ..."