Sentence examples for feasible function from inspiring English sources

The prototype of this new instrument is analyzed and optimized through computer aided modeling and simulation, in order to prove its feasible function, reliable performance, and mechanical advantage.

In order to resolve this problem, the article proposes an optimization method that uses machine learning techniques for functional data in order to represent the perimeter of the set of feasible functions and to speed up the process of evaluating the restrictions in each iteration of the algorithm.

(iv) Among two feasible functions, the one with lower inconsistency will be selected.

First, in order to derive the practically feasible importance function (or the related likelihood function) by taking the complex nonlinear transform, we introduce the first-order Taylor expansion and develop a new representative dynamic state-space modeling (DSM) system via the local linearization technique.

Z best shows the best known feasible objective function value, and Z bound represents the upper bound of the objective function.

Like most optimisation processes, defining a feasible objective function is important, yet by no means trivial.

According to the Lingo software's documents, the ( {text{F}}_{text{best}} ) shows the best feasible objective function value (OFV) which has been found so far.

Fig. 3 Empirical probability that the problem is not feasible as function of the minimum target rate R m i n for each SU.

This study presents a GA-based approach combined with a feasible energy function for multiprocessor scheduling problems with resource and timing constraints in dynamic real-time scheduling.

In order to derive the feasible importance function with the complex nonlinear transform, by performing a Taylor expansion up to first-order of the observation equation at the point x k = x k *, we may further get y k = g x k + v k ≃ g x k * + ∂ g x k ∂ x k | x k = x k * x k − x k * + v k, (14).

CET classifies as feasible those functions whose most efficient algorithms have time complexity \(c \cdot n^k\) for arbitrarily large scalar factors \(c\) and exponents \ k\).