Sentence examples for an explicit enumeration from inspiring English sources

Factored MDPs, however, are not amenable to traditional solution methods that call for an explicit enumeration of the state space.

The performance of these proposed methods is compared with exact solutions achieved from an explicit enumeration approach followed in the small-scale instances.

It does not require an explicit enumeration of all paths to find the optimal set of transcripts.

An explicit enumeration for hard problem is normally time consuming due to exponentially increasing number of potential solutions.

An explicit enumeration and pairwise alignment of all the putative DNA sequences is not an option, since their number increases exponentially with the protein's length, as all amino acids are encoded by 2, 3, 4 or 6 codons, with the exception of M and W, which have a single corresponding codon.

To develop a practical method, we develop an integer linear programming (ILP) formulation to solve the tree insertion problem in an optimal way (without explicit enumeration).

Therefore, a generally applicable approach should avoid explicit enumeration, ideally still guaranteeing optimality.

We also present a simulation test of the proposed algorithm and a comparison with two hybrid predictive control methods: Explicit Enumeration and Branch and Bound (BB).

Instead of explicit enumeration of the BN, we use an extensible, implicit SAT-based ATPG approach to efficiently model and identify faults, and perform drug selection.

Finally, explicit enumeration of complex features may also introduce a large number of unnecessary features, which will increase the running time of probability estimation.

To avoid explicit enumeration, we proposed in Garg et al., (2007) an implicit method based on ROBDD (Burch et al., 1994; Xie and Beerel, 1998) to compute attractors using Boolean equations having a similar representation as Equations (1– 4).