2974 search results - page 282 / 595 » Model-Driven Constraint Programming |
191
Voted
CPAIOR
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. Logic-based Benders decomposition can combine mixed integer programming and constraint programming to solve planning and scheduling problems much faster than either metho...
167
click to vote
ICFP
1997
ACM
15 years 10 months ago
1997
ACM
We present a type system for the programming language Erlang. The type system supports subtyping and declarationfree recursive types, using subtyping constraints. Our system is si...
248
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
We propose a novel framework for constrained spectral
clustering with pairwise constraints which specify whether
two objects belong to the same cluster or not. Unlike previous
m...
199
click to vote
CADE
2009
Springer
16 years 7 months ago
2009
Springer
Abstract. Polynomial constraint-solving plays a prominent role in several areas of engineering and software verification. In particular, polynomial constraint solving has a long an...
156
click to vote
ICTAI
2007
IEEE
16 years 28 days ago
2007
IEEE
Domain filtering local consistencies, such as inverse consistencies, that only delete values and do not add new constraints are particularly useful in Constraint Programming. Alt...