### Table 6: Savings due to probabilistic lifting compared to the deterministic approach.

1998

Cited by 23

### TABLE III COMPARISON OF TOTAL NUMBER OF CHANNELS REQUIRED FOR DETERMINISTIC, PROBABILISTIC AND DISTRIBUTED (SHORTEST DISJOINT PATHS) APPROACHES. PERCENTAGES ARE RELATIVE TO DETERMINISTIC APPROACH.

in Distributed Computation of Shared Backup Path in Mesh Optical Networks using Probabilistic Methods

2004

Cited by 2

### Table 2: Comparison between the participation to inertia of non-structural elements based on the statistical and deterministic approaches

in SUMMARY

"... In PAGE 3: ... The deterministic results confirmed the statistical results. Table2 shows a comparison between the participation to the effective inertia of non-structural elements as obtained by the statistical and deterministic approaches. 3.... ..."

### Table 1. Comparison between a pseudo-deterministic ATPG and the proposed approach.

"... In PAGE 6: ... It uses a constraint solver to traverse the DUV state space but it does not exploit neither propagation and justification strategies on HLDDs nor backjumping on EFSMs. The second part of Table1 reports such a comparison. In par- ticular, the Table shows the time required to automatically gen- erate the HLDDs and the corresponding S2EFSMs (GT (sec.... ..."

### Table 1. Debt Sustainability Analysis (DSA) and Risk Assessment Deterministic Bound Testing Probabilistic Approach

2006

"... In PAGE 6: ... Deviations of actual policies from the benchmark provided by the estimated reaction function may prove useful in assessing such effort, and thereby assessing the room for fiscal adjustment (Abiad and Ostry, 2005; and Debrun, 2005a). Table1 summarizes some key differences between the usual DSA framework and the extended DSA proposed in this paper. 4Our simulation tool can, however, accommodate any normative policy scenario, including the constant ... ..."

Cited by 1

### Table 3: Minimum power obtained by deterministic ( = 3) and statistical approaches ( = 99:8% tar- get yield) for di erent timing targets (deterministic sizing / statistical sizing).

2005

"... In PAGE 4: ... We use Tmin as the timing target for the deterministic and statisti- cal sizing problems. Table3 presents the power savings obtained from statisti- cal sizing. The Tmin for each circuit is presented in column 2.... In PAGE 6: ... Even though the circuit was optimized for power under the constraint that circuit delay is less than Tmin, the worst-case deterministic sizing gives a much tighter clock period. This ensures a 100% yield, but at the expense of increased power (from Table3 , power is 0:511mW). 0.... ..."

Cited by 1

### Table 3 shows a comparison of the area overhead for the proposed hybrid BIST approach compared with the best published results for deterministic BIST in [Kiefer 981

"... In PAGE 6: ... Comparison of Proposed Hybrid BIST Scheme with External Testing 331800 150306 316160 366000 - Rows 96 99 62 - 35 35 22 74 100 75 255 358 27 1 227 44 64 65 53 - - Test Data 37 1 Test Data Compression Ratio 38 77 180 632 1261 3016 70 140 28 1 17 34 67 119 111 190 381 595 Table 2. Comparison of Proposed Hybrid BIST Scheme with BIST Followed by Top-Up Test Patterns from Tester Table3 . Comparison of Proposed Hybrid BIST Scheme with Deterministic BIST Scheme Described in [Kiefer 981 Compression ... ..."

### Table 2. Results for latency-reduction using a method similar to transient-reduc- tion approach for FFT graphs with non-deterministic execution times.

"... In PAGE 34: ...1, given a periodic-output latency and an output buffer size for a system, the throughput of the system can be calculated and vice-versa. The results of scheduling with an aim to reduce periodic-output latency, using a technique that is conceptually very similar to the transient-reduction technique, are tabulated in Table2 . Here, after get- ting an initial schedule after phase 1, the average iteration period of the execution LB... In PAGE 36: ...(13) where and are the periodic-output latencies of the schedule input to latency-reduction post-processing and the final output schedule respectively, for a given and . One can see from Table2 , that in case of non-deterministic execution times, in about half of the cases, this approach does not lead to a low-latency schedule. This is expected, as in our approach we are trying to reduce latency by starting from a state that is expected to be closer to the state at , but, because the execution times are non-deterministic, this approach of starting from some better state fails.... ..."

Cited by 1

### Table 2: Results for problems with deterministic load arrivals and deterministic travel times.

"... In PAGE 19: ... the objective value at each iteration with the objective value of problem (28). In Table2 , we show the objective value provided by our approach after 50, 100 and 250 iterations, and the runtime per iteration. (An iteration involves solving T approximate subproblems of form (18) and updating the value function approximations.... ..."

Cited by 1

### Table 3: Analytic convergence rates on the Gaussian approximation to jy; in the SV case. DUGS denotes deterministic updating Gibbs sampler. K denotes the number of knots. Ran- dom block is the approach advocated in this paper.

"... In PAGE 26: ...UGS denotes deterministic updating Gibbs sampler. K denotes the number of knots. Ran- dom block is the approach advocated in this paper. The results given in Table3 show the convergence rate for the single-move Gibbs sampler. As we would expect, the convergence rate for the daily data is much slower than for the weekly data, having half lives of 144 and 14.... ..."