Sentence examples for values of the complexity from inspiring English sources

The values of the complexity of these projects are also different.

Finally, we analyze mutual relations between numbers of possible product configurations and obtained values of the complexity measures.

In this paper, we want to discover which type of datasets, defined by certain range values of the complexity measures for supervised classification, fits for some of the most well-known semi-naive Bayesian network classifiers.

Note that, since the CID value represent the configuration label, whenever the optimization procedure needs to lookup the values of the complexity and bitrate, the CID value needs be rounded to the nearest integer.

We now turn to computing the value of the complexity function for a given l-Grigorchuk subshift.

Convergence of a proposed iterative algorithm is asymptotically necessary and sufficient for TS system stabilisation: for a high-enough value of the complexity parameter, any conceivable shape-independent Lyapunov controller design procedure will yield a proven domain of attraction smaller or equal to the algorithm's output.

It was further revealed that the pattern of the dynamical complexity variations in 2012 follow a similar trend from July to December for N100 and dN/dH with the values of the dynamical complexity parameters computed for NS having a huge departure from the other two heights with lower complexity values.

In general, the objective of these code searches is to determine the best spectra for a list of fixed values of the trellis complexity, as performed in [6].

All of these processes are likely to be heavily contested given the multiplicity of interests, the competing values, and the complexity of the stakeholder environment, which are all characteristic of many LMICs.

The predictions of the model, as far as trends are concerned, are shown to be satisfactory given the level of uncertainty about parameter values and the complexity of the system being studied.

Besides, we assume that n ζ 0 < C n < n ζ p ¯, which means that the sum complexity constraint is less than the worst-case sum complexity n ζ p ¯ while larger than n ζ 0 that is the minimum possible value of the sum complexity of ET-FSD with n users.