Sentence examples for be minimized is defined from inspiring English sources

The cost function to be minimized is defined through a mean value of the insertion loss due to the added crowning compared to the straight, rigid barrier solution of same overall height, averaged on several receiver points within the barrier shadow zone.

Now a cost function to be minimized is defined on the set points.

The cost function to be minimized is defined as follows: begin{array}rcl@ ({b}-{A}{x})^{T}{Q}^{-1}({b}-{A}{x}).

At first, the unknown bivariate function is replaced by a multilayer perceptron neural net and also a cost function to be minimized is defined.

The score function to be minimized is defined as follows: {eta}_r=frac{{displaystyle {sum}_{i,j}{left({f}_{ri}-{f}_{rj}right)}^2left({S}_{ij}+{overline{mathcal{N}}}_{ij}right)}}{varSigma_r+{varSigma}_r^b-{varSigma}_r^w}, (9).

Hence the domain where F λ must be minimized is defined by the multiplicities of the degrees 1, …, n − 1 of the vertices of a tree T of order n.

The target function, T, which is minimized, is defined in Eq. (4) as: (4) where, In,obs and In,calc are the observed and calculated intensities, respectively, at a given timepoint.

The objective function to minimize is defined as (10).

Vertex Bisection Minimization problem (VBMP) consists of partitioning a vertex set into two sets B and B′ where |B|="|V|/2 such that vertex width, VW, is minimized which is defined as the number of vertices in B which are adjacent to at least one vertex in B′.

An objective function is defined, and is minimized by a gradien method.

Thus, Problem 1 is transformed into: Problem 3. Find a z ∈ Z such that E1 z), which is defined by (4.12), is minimized.