Sciweavers

6 search results - page 1 / 2
» Propagate the Right Thing: How Preferences Can Speed-Up Cons...
Sort
View
IJCAI
2003
13 years 5 months ago
Propagate the Right Thing: How Preferences Can Speed-Up Constraint Solving
We present an algorithm Pref-AC that limits arc consistency (AC) to the preferred choices of a tree search procedure and that makes constraint solving more efficient without chan...
Christian Bessière, Anaïs Fabre, Ulric...
NIPS
1993
13 years 5 months ago
Using Local Trajectory Optimizers to Speed Up Global Optimization in Dynamic Programming
Dynamic programming provides a methodology to develop planners and controllers for nonlinear systems. However, general dynamic programming is computationally intractable. We have ...
Christopher G. Atkeson
CP
2003
Springer
13 years 9 months ago
Propagation Redundancy in Redundant Modelling
Combining mutually redundant models with channelling constraints increases constraint propagation. However, the extra computation efforts of the additional variables and constraint...
Chiu Wo Choi, Jimmy Ho-Man Lee, Peter J. Stuckey
JETAI
2010
115views more  JETAI 2010»
13 years 3 months ago
From soft constraints to bipolar preferences: modelling framework and solving issues
Real-life problems present several kinds of preferences. We focus on problems with both positive and negative preferences, that we call bipolar preference problems. Although seemi...
Stefano Bistarelli, Maria Silvia Pini, Francesca R...
CSCLP
2006
Springer
13 years 8 months ago
Bipolar Preference Problems: Framework, Properties and Solving Techniques
Real-life problems present several kinds of preferences. We focus on problems with both positive and negative preferences, that we call bipolar preference problems. Although seemin...
Stefano Bistarelli, Maria Silvia Pini, Francesca R...