673 search results - page 29 / 135 » Preference-Based Problem Solving for Constraint Programming |
CADE
2011
Springer
12 years 7 months ago
2011
Springer
Abstract. Methods exploiting problem symmetries have been very successful in several areas including constraint programming and SAT solving. We here recast a technique to enhance t...
PPDP
1999
Springer
13 years 12 months ago
1999
Springer
OPL is a modeling language for mathematical programming and combinatorial optimization problems. It is the rst modeling language to combine high-level algebraic and set notations f...
IROS
2008
IEEE
14 years 2 months ago
2008
IEEE
— We present a probabilistic architecture for solving generically the problem of extracting the task constraints through a Programming by Demonstration (PbD) framework and for ge...
CP
2008
Springer
13 years 9 months ago
2008
Springer
Modern computer architectures have complex features that can only be fully taken advantage of if the compiler schedules the compiled code. A standard region of code for scheduling ...
CP
1999
Springer
13 years 12 months ago
1999
Springer
Abstract. In this paper, we present a major improvement in the search procedures in constraint programming. First, we integrate various search procedures from AI and OR. Second, we...