13841 search results - page 248 / 2769 » Algorithms and Constraint Programming |
290
click to vote
POPL
2002
ACM
16 years 7 months ago
2002
ACM
We investigate the first-order theory of subtyping constraints. We show that the first-order theory of nonstructural subtyping is undecidable, and we show that in the case where a...
157
click to vote
CP
2003
Springer
15 years 12 months ago
2003
Springer
Abstract. In many situations, a set of hard constraints encodes the feasible configurations of some system or product over which users have preferences. We consider the problem of...
192
click to vote
KDD
2007
ACM
16 years 7 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...
174
click to vote
ESOP
1992
Springer
15 years 10 months ago
1992
Springer
Dynamic typing is a program analysis targeted at removing runtime tagging and untagging operations from programs written in dynamically typed languages. This paper compares dynami...
140
click to vote
CP
2004
Springer
16 years 9 hour ago
2004
Springer
Abstract. We introduce a new approach for focusing constraint reasoning using so-called streamlining constraints. Such constraints partition the solution space to drive the search ...