4117 search results - page 211 / 824 » On the Satisfiability of Complex Constraints |
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...
203
click to vote
DSRT
2008
IEEE
15 years 8 months ago
2008
IEEE
The complexity and the variety of the deployed timedependent systems, as well as the high degree of reliability required for their global functioning, justify the care provided to...
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...