Sentence examples for base of this algorithm from inspiring English sources

The base of this algorithm relies on the accumulation moments and is easily computed thanks to a simple accumulation grid.

The base of this algorithm is reducing the maximum achievable braking forces of one side wheels, as low as possible, so that the minimum stabilizing yaw moment is produced.

Given a complete edge-weighted graph G, we present a polynomial time algorithm to compute a degree-four-bounded spanning Eulerian subgraph of 2G that has at most 1.5 times the weight of an optimal TSP solution of G. Based on this algorithm and a novel use of orientations in graphs, we obtain a (3β/4+3β2/4 -approximation algorithm for TSP with β-relaxed triangle inequality (β-TSP), where β≥1.

Based on this algorithm, the impact of the lower specificity of WNV.EDIII (Sp = 92.3%) and JEV.EDIII (Sp = 94.7%) tests was reduced by the fact that false reactives with WNV.EDIII or JEV.EDIII were discarded if the WNV.sE signal was found to be negative.

The mixing rates for the 3D Rayleigh Taylor instability of miscible fluids based on this algorithm agree with experimental values.

Based on this algorithm, the initialization of the detector is made using the LMP test.

Based on this algorithm, collision prediction of over 150 Chinese spacecraft for a time span of 3 days can be completed in less than 3 h on a single computer, which meets the timeliness requirement of the initial screening task.

Therefore, we will obtain general MCA analysis result and extend the properties based on the study of this algorithm.

A multi-target version of this algorithm based on the PDA methodology is described in [8].

Therefore, the power consumption of this algorithm based on N@L motes is much bigger than that of MICAz motes.

An advantage of this algorithm based on color is that it is robust to specific color objects; however, a disadvantage is that it is sensitive to non-specific color objects due to illumination and noise.