128 search results - page 22 / 26 » Partitioning a weighted partial order |
IJCAI
1993
13 years 8 months ago
1993
We have written a prototype computer program called TrenDx for automated trend detection during process monitoring. The program uses a representation called trend templates that d...
AI
2008
Springer
13 years 7 months ago
2008
Springer
Preference learning is a challenging problem that involves the prediction of complex structures, such as weak or partial order relations, rather than single values. In the recent ...
MOC
2000
13 years 7 months ago
2000
Recently Laurie presented a new algorithm for the computation of (2n+1)-point Gauss-Kronrod quadrature rules with real nodes and positive weights. This algorithm first determines a...
MP
1998
13 years 7 months ago
1998
We define the base polytope B(P, g) of a partially ordered set P and a supermodular function g on the ideals ofP as the convex hull of the incidence vectors of all linear extensio...
STACS
2007
Springer
14 years 1 months ago
2007
Springer
The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...