### Table 1 Time and minimization results for greedy and optimal strategies.

"... In PAGE 8: ...bsolute value of x, i.e., j[x]j = hx0i If x is negative, then x0 = x, and obviously j[x]j = [x] = hx0i + 1 Combining both cases results in j[x]j = hx0i + xn 1 As x0 n 1 is always zero, we get j[x]j = hx0 n 2 : : : x0 0i + xn 1 The pseudo-Boolean constraints are then assigned almost exactly as in the unsigned case, with the following exceptions: (i) the constraints for every place value, not including the sign bit are based on x0 rather than x and (ii) the weight of the sign bit is 1, rather than 2n 1. Thus, we minimize xn 1 + n 2 X i=0 2i x0 i (5) 5 Experimental Results Table1 shows results for minimization of counterexamples for several pro- grams. The rst column shows which program is being model checked.... ..."

### Table 2: E ect of Minimizing Strategies on Inac- cessibility Times (5Mbps, lredAd = 8, tSD = 11 s, tSlot = 27 s)

"... In PAGE 8: ...stations (more than enough) in the cell network. The gures obtained are presented in Table2 . The multi- ple failure scenarios are omitted, as results from the application of the Address Ordering Policy.... ..."

### Table 4: Minimal Traffic and Traffic Effects of Different Elements of Paging Strategy.

1997

"... In PAGE 12: ... 7.3 EFFECTIVENESS OF STRATEGY ELEMENTS To understand the significance of these results and the relative importance of the different strategy elements we con- sider the following experiments summarized in Table4 . As a lower bound on the traffic, we note that for users who never move and never update, they still must be paged in their PA for every incoming call and they still may not respond.... ..."

Cited by 31

### Table I. Comparison of strategies against design criteria. Inclusiveness Effectiveness Minimizing User Work Minimizing Intrusiveness

2002

Cited by 43

### Table 2: The model feature experiments using a minimal maximum response patch imprinting strategy.

in Phonetic Classification Using Hierarchical, Feed-forward, Spectro-temporal Patch-based Architectures

2007

### Table 2: The model feature experiments using a minimal maximum response patch imprinting strategy.

in Phonetic Classification Using Hierarchical, Feed-forward, Spectro-temporal Patch-based Architectures

2007

### Table 5.8: The running time of different branching strategies for the Golomb ruler problems with least minimal bound ordering

### Table 1: The theoretically maximum attainable PE port utilization for the minimal-adaptive (Best Paths) and non-minimal- adaptive (Derouting)strategies, and the throughputpenalty for using the deroutingstrategy, for different network sizes. Where the values of the PE port utilization are less than 100%, the internal port utilization is 100%.

"... In PAGE 4: ...00 70.00 Figure 2: Normalised Average Message Latency for Differ- ent Routing Strategies and 10% Long Messages Workload Table1 illustrates that as the network size grows, using the Derouting strategy asymptotically causes an effective decrease of about 30% in overall network throughput. 4 Bursty Traffic and Different Routing Strategies While performance evaluation of packet-switched in- terconnects has focused on the latency of packets, appli- cations are more concerned with the overall latency of variable-sized messages.... ..."

### Table 1: The ve sequences in the time series 10,20,30,60,10,20,30,10. The neural network is asked to predict the next element in the sequence given the previous three elements. Strategy A is the prediction made by the strategy which minimizes the sum of squared errors. Strategy B is a strategy which has a higher sum of squared errors, but a lower Sharpe ratio, than strategy A, as shown in Table 2.

"... In PAGE 8: ... If the neural network is asked to predict the next element in this series given the three previous elements then there are a total of four unique input sequences and ve input/output pairs, as shown in Table 1. This table shows two strategies, strategy A and strategy B, which produce the same output for three of the four input sequences, but di er on the only sequence which is not followed by a unique element (the rst and last rows in Table1 ). Strategy A is the optimal sum of squared errors strategy but strategy B has a better Sharpe ratio, as shown in... ..."