Sentence examples for a general algorithm that from inspiring English sources

Furthermore, this is a general algorithm that can be applied to any fermentation elutriation scheme with or without fermentation reactor.

Then, we design a general algorithm that makes use, for the solution of a subproblem, of an α-approximation algorithm known for the knapsack problem.

Here, we have developed a general algorithm that provides a ranking and a visualisation of the heterogeneity in small animal positron emission tomography (PET) images.

The general theory developed provides an integrated framework to solve various vibration isolation and control problems and provides a basis to develop a general algorithm that may allow the user to build arbitrarily complex linear control models using simple commands and inputs.

In this section, we present a general algorithm, that is exact in the case of a uniquely leaf-labelled gene tree (Section "Uniquely leaf-labelled gene trees") or a gene tree satisfying CONSTRAINT C (Section "No AD above NAD"), and a heuristic in the general case.

They applied the optimization criteria outlined by Zhang et al. [ 10, 18] and described a general algorithm that defined block boundaries in a way that minimizes the number of tag SNPs that are required to distinguish uniquely a certain percentage of all the haplotypes in a region.

As a result, any general algorithm that turns a data set into a formula that describes the system over time can't be simplified so that it can run on a computer, the team reports in an upcoming issue of Physical Review Letters.

By consistently treating the advection velocity in the conservative term and the velocity divergence in the source term by imposing a new additional criterion, specifically, that a multicomponent-fluid algorithm should have the ability of maintaining a pure single-fluid, we finally derive a new general algorithm that does not need any special treatment, and is very convenient to implement.

There has been no general algorithm that allows the automatic learning of arbitrary 3-D objects and their recognition and localization in complex scenes.

We provide a more general algorithm that although may not find the optimum in all cases, will in general produce high-quality alignments.

We present a general algorithm, palo, that returns an element that is, with provably high probability, essentially a local optimum.