Sentence examples for original constraints from inspiring English sources

(26) and (27) correspond to the original constraints from Eqs. (7) and (6), respectively.

The transformation equation (Eqs. 31 34) is added to the original constraints.

This is achieved by introducing additional constraints, and by slightly tightening the original constraints.

Also, it is shown how the algorithm performance can be improved by integrating suitable soft constraints with the original constraints.

These new constraints are obviously a relaxation of the original constraints and hence lead to an outer bound on the SPCGS rate region.

Furthermore, the problem is reformulated by introducing an extra decision vector to transform the original constraints into linear constraints, and then, a two-phase method is presented to solve the problem efficiently.

This kind of transformation keeps the uncertainty of the original constraint region as much as possible.

Its geographic search is also often off, and even though you provide the service with a ZIP code, it seems to look far beyond your original constraint.

This type of conversion is able to keep the uncertainty of the original constraint region to a larger extent.

The approach in (10) turns out to be a relay selection technique with uniform gain allocation among only selected relays to fully satisfy the original constraint.

Thus, for the original constraint C2, we have the following convex reformulation (widetilde {C2}) composed of several sub-constraints widetilde{C2:}left{begin{array}{l} widetilde{C2.1.1}, widetilde{C2.1.2}, widetilde{C2.1.3}, C2.1.4, widetilde{C2.2.1}, C2.2.2, C2.3.