Sentence examples for enumeration tree from inspiring English sources
Second, BiMine uses a new tree structure, called Bicluster Enumeration Tree (BET), to represent the different biclusters discovered during the enumeration process.
Second, BiMine uses a new tree structure, called Bicluster Enumeration Tree (BET), to represent conveniently the different biclusters discovered during the enumeration process.
Although, in principle, we could enumerate all MXSTs by traversing the complete enumeration tree of ASTs, the sheer number of ASTs makes this approach, used by itself, impractical.
After this, MFSTMINER invokes subroutine ENUMERATENODE, explained next, to enumerate the elements of the branch at each equivalence class in E C3. Algorithm 2 shows the details of ENUMERATENODE, which accepts an equivalence class E as input and enumerates the branch at E in the enumeration tree.
Step 2. Start to search the enumeration tree with Bounding_Cost.
Each leaf node of the enumeration tree corresponds to a convex multi-objective NLP, which is solved heuristically by varying the weights in a weighted sum approach.
We apply a machine learning module based on an eXtended Semantic Enumeration (XSE) tree to activate linguistic tests from semantic, syntactic, and pragmatic analyses during the traversal of the tree.
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).
The results of computational experiments reveal that the computational efficiency of the new algorithm is as good as those for enumeration of tree-like chemical compounds.
Fujiwara et al.[28] studied enumeration of tree-like chemical graphs that satisfy a given feature vector which specifies frequency of paths of up to a prescribed length K in a chemical compound to be constructed.
Development of algorithms for enumerating chemical graphs with a "non-tree structure" is thereby a challenging task if we still wish to attain high computational efficiency as we have achieved for enumeration of tree-like chemical graphs, because no such effective representation scheme is known for general graphs.
