4524 search results - page 206 / 905 » The Complexity of Global Constraints |
190
click to vote
CP
1999
Springer
15 years 11 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...
168
click to vote
ARCS
2006
Springer
15 years 10 months ago
2006
Springer
Hierarchical software components offer interesting characteristics for the development of complex applications. However, supporting the deployment of such applications is difficult...
139
click to vote
AAAI
2007
15 years 9 months ago
2007
We develop an efficient incremental version of an existing cost-based filtering algorithm for the knapsack constraint. On a universe of n elements, m invocations of the algorith...
151
click to vote
CP
2008
Springer
15 years 8 months ago
2008
Springer
Recently, a new domain store for set-variables has been proposed which totally orders all values in the domain of a set-variable based on cardinality and lexicography. Traditionall...
168
click to vote
IJCAI
1997
15 years 8 months ago
1997
Unfailing completion is a commonly used technique for equational reasoning. For equational problems with associative and commutative functions, unfailing completion often generate...