Sentence examples for by considering an approximate from inspiring English sources

The Cycle Elimination (CE) approach presented in Nasr et al. (2016) reduces the computational complexity of analyzing iterative PD project networks by considering an approximate network with no iteration.

(5)This expression seems not to have a simple interpretation, compared to Equation 4. The estimator in Equation 4 can also be obtained by considering an approximate process in which frequency increments are normally distributed (Watterson 1982).

They stated the proofs by considering an approximating completely continuous operator.

The variation of emissivity with respect to the wavelength is approximated by considering a set of spectral bands with constant emissivities and then the radiative transfer equation is solved by the net radiation method for each band.

Hence, the corresponding PSD is given by the Fourier transform ( S_{mathrm {x}}(f)= frac {M_{text {Tx}}}{T_{mathrm {s}}} sum _{k=-infty }^{infty } c_{k} e^{j 2 pi frac {k T_{mathrm {s}} }{ M_{text {Tx}} }f} ), where the infinite sum can be approximated by considering a very large number of coefficients.

In the sequence scan phase, each distribution Dij was approximated by considering a limited number of comparisons with the objects in a cluster equal to the square root of the cluster size, with a minimum of 10 comparisons (unless the cluster size was smaller) and a maximum of 100, i.e. min{max{sqrt |ci|),10},100}.

Next, by considering a comparative RFID system, which well approximates the original system, we establish closed-form formulas for the aforementioned parameters.

The QIFFT method can be considered an approximate maximum likelihood method for spectral peak estimation, as we will see.

Our approach is to consider an approximate problem first.

Moreover, even when the CCC-Biclusters are not functionally enriched, the 1-CCC-Biclusters obtained by considering approximate expression patterns instead of perfect patterns are always functionally enriched.

In the proposed algorithm, each normal node approximates the shortest paths to two arbitrary anchors with a virtual hole placed between the anchors and estimates the distances to the anchors by considering how much their approximate shortest paths are detoured.