Sentence examples for general reformulation from inspiring English sources

Since we are presently considering a mode of authentic, i.e., not fallen, Dasein, it seems that fallen-ness cannot be a feature of this realization of care, and indeed that a general reformulation of the care structure is called for in order to allow for authentic Being.

This paper does not present a general theory of reformulation, but it studies a number of known reformulation techniques to achieve a broad understanding of the space of available reformulations.

We extend known reformulation approaches to reformulate the general 0 1 fractional programming problem such that it can be solved by standard MILP software.

Since the mapping gives a semantic correspondence between an edge in the concrete entities level and a path in the abstract entities level, a path in the general graph has equivalent reformulations.

The proposed algorithm is derived for ARX system only, but it allows for future reformulation for a general ARMAX system with known moving average (MA) part.

The conclusion of the analysis shows that this reformulation fails in general if one assumes more than two leaks with fixed positions in the pipeline.

James T. B. Tripp, general counsel of Environmental Defense, said that the reformulation study should advance a policy of no private homes in the dune area.

Despite Bickle's reformulation of reduction, mechanists generally resist the "reductionist" label.

In this paper, we compare two cutting-plane algorithms to compute the same lower bound on the optimal value of the problem: one based on the generation of residual capacity inequalities within the model with general integer variables, and the other based on the addition of extended linking inequalities to the 0 1 reformulation.

The reformulation of the basic FIPS structure results in a general approach that balances computational efficiency and flexibility.

However, the recent research by Dempe and Dutta [13] shows that in general the original bilevel programming problem and its K-K-T reformulation are not always equivalent, even in the case when the lower level programming problem is a parametric convex optimization problem.