4940 search results - page 937 / 988 » On the Complexity of Universal Programs |
239
click to vote
CP
2009
Springer
16 years 3 months ago
2009
Springer
The ALLDIFFERENT constraint was one of the first global constraints [17] and it enforces the conjunction of one binary constraint, the not-equal constraint, for every pair of varia...
142
Voted
KDD
2007
ACM
16 years 3 months ago
2007
ACM
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
153
click to vote
CHI
2006
ACM
16 years 3 months ago
2006
ACM
People come to online communities seeking information, encouragement, and conversation. When a community responds, participants benefit and become more committed. Yet interactions...
119
Voted
RECOMB
2005
Springer
16 years 3 months ago
2005
Springer
This paper proposes a novel tree decomposition based side-chain assignment algorithm, which can obtain the globally optimal solution of the side-chain packing problem very efficien...
138
click to vote
RECOMB
2005
Springer
16 years 3 months ago
2005
Springer
Abstract. In order to guarantee that the optimal motif is found, traditional pattern-driven approaches perform an exhaustive search over all candidate motifs of length l. We develo...