Sentence examples for enumeration by from inspiring English sources

The enumeration by qPCR is calculated with standard curves for different bacterial species.

Furthermore, we show that the proposed mechanism can be extended to obviate path enumeration by introducing a column generation procedure.

The proposed VS procedure offers significant computational savings over complete enumeration by avoiding the repeated integration of differential equations for reduced reaction sets.

We denote B&K enumeration by bk_enum, the naive branch-and-bound method by bb_basic, the partial branching method by bb_pb, the incremental candidate generation method by bb_inc.

Dehalococcoides enumeration by CARD-FISH yielded a linear curve in the analyzed concentration range which was consistent with the expected concentrations and showed good reproducibility in triplicate assays.

In this paper, we first present algorithms for finding exact solutions for densest k-subgraph which improve upon the standard exponential time complexity of an exhaustive enumeration by creating a link between the computation of an optimum for this problem to the computation of other graph-parameters such as dominating set, vertex cover, longest path, etc.

We can get an array of Move enumerations by calling the values method: Move.values.values

We find that the algorithms considered obtain performance gains similar to the optimal ones found by complete enumeration or by large random searches but in a tiny fraction of the computation time.

To solve the model, an enumeration-followed-by-optimization approach is proposed which first computes feasible routes and then selects the set of best ones.

However, an exact solution can be obtained by various methods of reduced enumeration, typically by a branch and bound (B&B) algorithm.

We develop an efficient algorithm for this enumeration problem by extending existing algorithms [13, 14] for enumerating tree-like chemical structures (i.e., chemical structures without cycles).