Sentence examples for constrained search from inspiring English sources

Applications of rule chaining, heuristic search, constraint propagation, constrained search, inheritance, and other problem-solving paradigms.

Software Product Lines Engineering SPLEE) consists in optimising those large and highly constrained search spaces according to multiple objectives reflecting the preference of the different stakeholders.

Using symmetry constrained search and Nudged Elastic Band method, we characterize the transition states for an oxygen anion moving into a nearby oxygen vacancy site that is surrounded by different cations and find the activation energies to vary in the range of 30 50 kJ/mol in good agreement with experimental data.

We also tested for monophyly of all asexual respectively sexual species using the same approach (constrained search with asexuals resp. sexuals as a monophyletic clade).

In general, computational prediction of miRNAs uses a highly constrained search space by setting fixed values to parameters like AU content, MFEI and the length of the pre-miRs [ 12, 13, 15, 16].

Since wQMC does not constrain the search space, this means that wQMC can find trees with better quartet scores but which are outside the constrained search space, and that constraining the search space seems to be beneficial with respect to topological accuracy.

Rapid and efficient inference is accomplished through the application of geometric operators in PSI space, allowing for both the derivation of discovery patterns from a large set of known TREATS relationships, and the application of these discovered patterns to constrain search for therapeutic relationships at scale.

The program is broad enough that documents indicate that analysts are asked to constrain searches to no more than 1,800 phone numbers at a time.

Since for most alignments the number of phylogenetically informative positions is low with respect to the number of sequences, trees contain a high number of unstable nodes and therefore it was not possible to constrain searches for convergence with a lower threshold value.

The use of a backtracking-based repairing procedure and of evolutionary search operators constraining the search to the space of valid conformations produces good results for the 3D HP problem.

Thus, although we cannot guarantee optimality over the entire search space, we propose three methods to design high weight multiple seeds: a constrained exhaustive search, a reduction to the integer programming problem and a 'tuples-grouping' algorithm.