Sentence examples for bound is shown from inspiring English sources

This bound is shown to be optimal.

Furthermore, this lower bound is shown to be tight by presenting an algorithm with the matching upper bound.

An upper bound is shown to exist on the norm of the slope δ⟨O(T ⟩/δɛ(t) anywhere over the landscape, implying that the control landscape has gentle slopes permitting stable searches for optimal controls.

As a key result, the concept of Fisher information and the Cramér-Rao bound is shown to be applicable also to unknown systematic errors, which is demonstrated for several examples.

In Figure 6, the sum utility and the bound is shown for the scenario above however this time with slow fading corresponding to [14] in both air interfaces with a variance of.

The errors in this approach are quite small compared to the expected errors generated while surveying and constructing roadways, and the error bound is shown to converge to zero uniformly as the parameter governing the resolution of the algorithm is made smaller.

The sum utility per cell area and the upper bound are shown in Figure 4.

In addition, some slight reduction in the error bound was shown when angular spread increased from 5° to 18°.

Khavinson and Swia̧tek [8] confirmed Wilmshurst's conjecture when (m=1) using complex dynamics, and the bound was shown to be sharp by Geyer [6].

The minimum drop cost is determined for grooming ratio 9. Previously this bound was shown to be met when n≡0(mod9) with two exceptions and eleven additional possible exceptions for n, and also when n≡1(mod9) with one exception and one possible exception for n.

b90% confidence intervals around each lower and upper bound are shown in parentheses.