Sentence examples for approximation for computing from inspiring English sources

In this paper we present a new approximation for computing lower bound for the fixed charge transportation problem (FCTP).

Comparing the results with analytical solution indicated that the model provides a reasonable approximation for computing fluid injection pressure.

With the aid of (19), a lower bound of the outage probability can readily be computed as follows: Next, we present an accurate and computationally efficient closed-form approximation for computing a lower bound for the average SER.

Also, since the notion of static slice is generally undecidable, we introduce a complete approximation for computing static slices which is based on the construction of a term dependence graph, the counterpart of program dependence graphs.

For the cases (iv - vi) iv - vie 2, the quantine funcTableQ X (u) is in closed form, so the n th moment of the random variable X may be obtained from ( {E}_Xleft[{X}^nright]={int}_0^1{left[{Q}_X(u)right]}^n du. ) The following Theorem 3 derives an approximation for computing the n th moment of a member, Uniform-R{GL} of case (i).

SaddleSum, our implementation of Lugananni Rice approximation for computing enrichment P-values, first solves Equation (3) for using Newton's method and then returns the P-value using (4).

In order to avoid the computational complexity associated with the BCJR algorithm (or the max-log MAP or SOMA approximations), we consider two reduced-complexity approximations for computing the APPs.

The variation in the total length can be computed (Hill and Weir 2011) and there are also various methods and approximations for computing the numbers and distribution of the lengths of shared regions (Fisher 1954; Donnelly 1983; Stam 1980).

The remaining filters use the same nonlinear forecast model but they introduce model error through different moment closure approximations and/or linear tangent approximation used for computing the second-order statistics of the augmented stochastic forecast model.

Much attention has been given to designing approximation algorithms for computing the bandwidth, as it is NP-hard to approximate the bandwidth of general graphs with a constant factor guarantee.

We give exact and approximation algorithms for computing the Gromov hyperbolicity of an n-point discrete metric space.