Sentence examples for as the problem of finding from inspiring English sources

Generation expansion planning is defined as the problem of finding the technology type, number of generation units, size, and location of candidate plants within the planning horizon.

Since in many cases changes must be computed from old and new versions of the data, we define the hierarchical change detection problem as the problem of finding a "minimum-cost edit script" that transforms one data tree to another, and we present effcient algorithms for computing such an edit script.

Essentially, the FDM algorithm works by considering the time-series to be the autocorrelation function of a fictitious dynamical system, such that the problem of finding the frequencies and decay constants is re-expressed as the problem of finding the eigenvalues of the complex-symmetric time-evolution operator of this system.

The open problems of finding exact ESCT expressions for completely specified functions of more than six variables as well as the problem of finding exact ESCT expressions for incompletely specified functions are solved here based on ESOP principles, for the first time.

Many related problems can be cast as the problem of finding fixed points for nonlinear mappings.

In this setting, the SFP is formulated as the problem of finding a point x ∗ with the property x ∗ ∈ C and A x ∗ ∈ Q, (1.1).

By representing genomes as permutations, the problem of finding the shortest sequence of rearrangement events that transforms one genome into another can be reduced to the combinatorial problem of calculating the minimum number of operations necessary to transform one permutation into another.

Fermat's method, representative of many, had as its exemplar the problem of finding the rectangle that maximizes the area for a given perimeter.

More important still, it is a piece of architecture that addresses itself brilliantly to a concern that goes to the very essence of Kyoto as a city, the problem of finding common ground between past and present.

As a result, the problem of finding the optimal arrangement for wireless communication without interference is transformed into the problem of finding the maximum independent set on the obtained contradiction graph.

As applications, we consider the problem of finding zeros of m-accretive operators based on an iterative process with errors.