Sentence examples for recursive cases from inspiring English sources

Now consider the recursive cases, assuming that lists X and Y are sorted.

So it is natural to extend the classical stochastic optimal control problem to the recursive case.

The strategies for the design of the weighting coefficients are presented in the algorithm incorporating fuzzy rules, for recursive and non-recursive implementation, including a least-squares derivation for the non-recursive case, which leads to a close form expression for the optimal weighting coefficients.

Modified correspondence theories also aim at providing a definition of truth, though in their case the definition will be considerably more complex, owing to the recursive character of the account.

The present paper explains ways and means for achieving this for a special case: recursive entities.

Note that it gives a small similarity as node equality to avoid zero matching value because of multiplication of recursive algorithm in case if all sub-trees matching value is zero.

In this case, recursive methods, which can update adaptively the CSP features on a sample basis, might be needed [27].

Next, we show how to reduce the number of expressions that need to be considered in the EDDC recursive equations, in case Constraint 1 applies.

Unless stated for specific cases, the recursive convolutional code (RSC) [1 15/3] with rate 1/2 is used.

In these cases the recursive scheme in Theorem 2.5 can be solved for large classes of payoff functions h without requiring local Lipschitz continuity.

After that, J48 algorithm divides the samples based on the attribute that provides the highest normalized information gain value to make the split and making this mechanism to be recursive until the base cases are matched.