Sentence examples for slow computation from inspiring English sources

Unfortunately, the desire for rich, powerful applications on mobile devices conflicts with the reality of these devices' limitations: slow computation processors, little memory storage, and limited battery life.

The combination of asynchrony and failures means that it is impossible to distinguish between a faulty robot that has halted and a robot subject to slow computation [5].

Another drawback of the logsweep analysis technique is that long excitation signals can take a long time to analyze due to the relatively slow computation of long convolutions.

Although Geweke's approach incorporates more realistic assumptions compared with [ 7], one shortcoming is its slow computation, which makes it unrealistic for large scale genetic studies [ 24], also tackled the problem of gene selection using the Bayesian variable selection framework.

The value of m determines the "resolution" of the algorithm, and must be sufficiently large to allow adequate representation of the knowledge space, but not so large as to excessively slow computation.

Dr. Alon said the genome-proteome networks that Dr. Young described handled the cell's slow computations, such as governing which genetic programs should be executed.

However, these comparisons tend to be computationally very demanding and often lead to very slow computations of the similarity measures.

The method relies on fast, vectorized computations such as summation and quaternion multiplication, rather than slow computations such as matrix exponentiation.

Our algorithm takes only 3.2 s for the periodic graph constructed in the previous subsection, while the previous algorithm takes 0.4 seconds for computing betweenness for the static graph, resulting in only an eightfold slower computation time compared to that when computing it on the infinite periodic graph.

However, this gain comes at the expense of a slower computation speed.

As for the efficiency, Hinsen's Hessian is less sparse than ANM's and therefore takes minimal advantage of the regular sparse matrix solver hence a slower computation than ANM, despite similar low-frequency modes being obtained in both (Cui and Bahar, 2006).