Sentence examples for complexity to carry from inspiring English sources

Therefore, the additional complexity to carry out beamforming is not worth at all in setups where the relays are closer to the destination than to the BS.

On the contrary, when the relays approach the destination, the quality of the link between BS and relays is the limiting factor and the extra complexity to carry out beamforming becomes useless.

This progression means that cognitive and linguistic complexity are both required to carry out tasks at the higher levels.

In spite of the recent advances in hardware technology, light mobile devices are not able to carry such complexity, and embedded speech-based functionalities have to be limited in order to satisfy the cost and hardware limits.

A coupled physical biogeochemical 1D model (BFM POM 1D) with an intermediate complexity benthic formulation was used to carry out sensitivity tests on the coupling parameters (sedimentation and diffusion at the sediment water interface).

We've found general rules for what makes an intelligent signal so my colleagues and I looked into what is required for a signal to carry intelligence complexity.

One of the possible confounding variables pertains to the difference of task complexity: The speaking groups had to carry out both button pressing and speaking tasks, whereas the control group needed to perform only the former.

Concretely, general and fundamental aspects of asymptotic complexity analysis are recalled and, in addition, the reference fixed point technique to carry out the complexity analysis of algorithms, due to Schellekens and in which our study is based, is presented in detail in order to motivate our subsequent work developed in Section 4.

Triumphalism is never quite truthful, and the trick is to hold it off for as long as possible before it sweeps in like a tide to carry away doubt, complexity and ambiguity.

Inspired by the preceding fact, we prove two fixed point theorems which provide the mathematical basis for a new technique to carry out asymptotic complexity analysis of algorithms via partial metrics.

In particular, new fixed-point theorems which differ from the Matthews onehave been proved in such a way that they provide a new mathematical basis to carry out anasymptotic complexity analysis of algorithms via partial metrics (concretely via p C ).