1977 search results - page 171 / 396 » The satisfactory partition problem |
191
click to vote
GFKL
2004
Springer
15 years 12 months ago
2004
Springer
Cluster ensembles are collections of individual solutions to a given clustering problem which are useful or necessary to consider in a wide range of applications. The R package˜c...
171
click to vote
AAAI
1994
15 years 8 months ago
1994
We apply decision tree induction to the problem of discourse clue word sense disambiguation. The automatic partitioning of the training set which is intrinsic to decision tree ind...
146
click to vote
COR
2008
15 years 6 months ago
2008
Dynamic constraint aggregation was recently introduced by Elhallaoui et al. [Dynamic aggregation of set partitioning constraints in column generation. Operations Research 2005; 53...
165
click to vote
JCO
2006
15 years 6 months ago
2006
A k-decomposition of a tree is a process in which the tree is recursively partitioned into k edge-disjoint subtrees until each subtree contains only one edge. We investigated the p...
178
click to vote
MOC
2002
15 years 6 months ago
2002
The mortar technique turns out to be well adapted to handle mesh adaptivity in finite elements, since it allows for working with nonnecessarily compatible discretizations on the el...