601 search results - page 38 / 121 » CSP(M): Constraint Satisfaction Problem over Models |
104
click to vote
CDC
2009
IEEE
15 years 2 months ago
2009
IEEE
Many model predictive control (MPC) schemes suffer from high computational complexity. Especially robust MPC schemes, which explicitly account for the effects of disturbances, can ...
CPAIOR
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. While several powerful methods exist for automatically detecting symmetries in instances of constraint satisfaction problems (CSPs), current methods for detecting symmetr...
102
click to vote
COMPULOG
1999
Springer
15 years 5 months ago
1999
Springer
Many constraint satisfaction problems can be naturally and efficiently modelled using non-binary constraints like the “all-different” and “global cardinality” constraints...
ICALT
2008
IEEE
15 years 8 months ago
2008
IEEE
Collaboration has long been considered an effective approach to learning. However, forming optimal groups can be a time consuming and complex task. Different approaches have been ...
AAAI
2006
15 years 2 months ago
2006
Many planning and design problems can be characterized as optimal search over a constrained network of conditional choices with preferences. To draw upon the advanced methods of c...