102 search results - page 16 / 21 » Hyper-heuristics for the dynamic variable ordering in constr... |
AAAI
2007
13 years 9 months ago
2007
In a constraint optimization problem (COP), many feasible valuations lead to the same objective value. This often means a huge search space and poor performance in the propagation...
ECAI
2004
Springer
13 years 11 months ago
2004
Springer
Quantified Constraint Satisfaction Problems (QCSPs) are CSPs in which some variables are universally quantified. For each possible value of such variables, we have to find ways to ...
ECAI
2008
Springer
13 years 9 months ago
2008
Springer
Building adaptive constraint solvers is a major challenge in constraint programming. An important line of research towards this goal is concerned with ways to dynamically adapt th...
IJCAI
2007
13 years 8 months ago
2007
Caching, symmetries, and search with decomposition are powerful techniques for pruning the search space of constraint problems. In this paper we present an innovative way of effi...
JCP
2007
13 years 7 months ago
2007
- The kinematic filter is a common tool in control and signal processing applications dealing with position, velocity and other kinematical variables. Usually the filter gain is gi...