2974 search results - page 72 / 595 » Model-Driven Constraint Programming |
167
click to vote
CP
1999
Springer
15 years 9 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...
150
click to vote
AAAI
2004
15 years 6 months ago
2004
A key feature of modern optimal planners such as Graphplan and Blackbox is their ability to prune large parts of the search space. Previous Partial Order Causal Link (POCL) planne...
129
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
Grothendieck inequalities are fundamental inequalities which are frequently used in many areas of mathematics and computer science. They can be interpreted as upper bounds for the ...
133
click to vote
CP
1999
Springer
15 years 9 months ago
1999
Springer
Column generation is a state-of-the-art method for optimally solving di cult large-scale optimization problems such as airline crew assignment. We show how to apply column generati...