Sentence examples for can be solved based on from inspiring English sources

The system TVFs can be solved based on (1).

The optimization problem formulated in (48) is a linear binary optimization problem which is equivalent to a bipartite matching problem in graph theory and can be solved based on the K-M algorithm [23].

Since the optimization problem formulated is a nonlinear fractional programming problem, which cannot be solved conveniently, we transform it to an equivalent optimization problem which can be solved based on iterative algorithm.

Partial Resolution Phase (PRP) The coordinator node determines whether all violations can be solved based on the messages from violated nodes (N_{mathcal {V}}) and itself alone according to the Algorithm 1.

As shown in (8), the second partial derivation of ∑ i = 1 N U i ( x i, k ) is negative, so it is concave and (P S ) can be solved based on the optimization theory.

where P j 1... j i ′ is the probability that there are j w, w = 1,..., i - 1, gains in the quantization region S w and (j i + 1) gains in the region S i. Replacing (30) and (31) in (13) the power-limited average rate optimization problem can be solved based on the channels distributions.

The minimum positive-sequence inductive output current to maintain the RECS's controllability corresponds to the maximum (i_{q + }^) defined as (i_{q + _hbox{max} }^), and can also be solved based on the relationship between (left| {dot{V}_{gdq} } right|_{hbox{max} }) and (i_{q + }^) as follows.

This issue, known as phase ambiguity, and can be solved through interpretation based on field geological knowledge or by adopting apposite phase unwrapping algorithms (Ghiglia & Romero, 1994), which count the number of cycles performed by the wave obtaining cumulated displacement maps.

We are optimistic that some of the still open questions concerning the phylogenetic position of the one or other taxon can be solved in the future based on re-investigations of material using new documentary methods.

We obtain analytic formulae for the gradients of cost functionals with respect to the parameters of the grating profile and the thickness of the layers, so that the optimal design problems can be solved by minimization algorithms based on gradient descent.

The input coefficients A(l), B(l), and C l)of the l th stage can be solved in similar manner, based on the STF numerator given in (9).