Sentence examples for a tighter analysis from inspiring English sources

Thus, the upper bound for the performance of Algorithm 1 can be improved with a tighter analysis if we have further knowledge about the distribution of harvesting rates among nodes.

In order to identify a given target language L, classical inference algorithms try to identify words which define identical residual languages of L. Here, we study whether it could be interesting to perform a tighter analysis by identifying inclusion relations between the residual languages of L. We consider the class of Residual Finite State Automata (RFSAs).

As a result, we give a tight analysis of the competitive ratio for every speed ratio.

We first give a tight analysis of the performance of a natural greedy algorithm LPT for the problem.

We give a tight analysis of the greedy algorithm introduced by Krumke and Wirth for the minimum label spanning tree problem.

We give a tight analysis of the MST heuristic recently introduced by G.-H. Lin and G. Xue for approximating the Steiner tree with minimum number of Steiner points and bounded edge-lengths.

This modification can lead to a tighter convergence analysis and weaker sufficient convergence conditions or error bounds or the location of the solution for Halley's method (see numerical examples).

Moreover, if K 0 is sufficiently smaller than K, which can happen since K K 0 can be arbitrarily large, then the results obtained in this study provide a tighter error analysis than the one in [10].

We also study some of the previously proposed algorithms for this problem, and give either tight or tighter analysis of their approximation ratio.

Nevertheless, combined with a tight-binding analysis, we found that some compounds have almost s2 configuration.

Combined with a tight-binding analysis, we found that some compounds actually have quasi-flat band.