7092 search results - page 365 / 1419 » Parallelizing constraint programs |
120
click to vote
AAAI
2007
15 years 5 months ago
2007
The gap in automation between MIP/SAT solvers and those for constraint programming and constraint-based local search hinders experimentation and adoption of these technologies and...
110
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Programs to solve so-called constraint problems are complex pieces of software which require many design decisions to be made more or less arbitrarily by the implementer. These dec...
122
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We study decompositions of the global NVALUE constraint. Our main contribution is theoretical: we show that there are propagators for global constraints like NVALUE which decomposi...
122
click to vote
COMSIS
2006
15 years 3 months ago
2006
Traditional knowledge representations were developed to encode complete, explicit and executable programs, a goal that makes them less than ideal for representing the incomplete an...
114
click to vote
CORR
2006
Springer
15 years 3 months ago
2006
Springer
In a previous work, the first author extended to higher-order rewriting and dependent types the use of size annotations in types, a termination proof technique called type or size ...