1589 search results - page 160 / 318 » Constraints with Variables' Annotations |
CSCLP
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. The union-find algorithm can be seen as solving simple equations between variables or constants. With a few lines of code change, we generalise its implementation in CHR...
IJCAI
2003
13 years 11 months ago
2003
There has been significant recent progress in reasoning and constraint processing methods. In areas such as planning and finite model-checking, current solution techniques can h...
UAI
1998
13 years 11 months ago
1998
Recent research in decision theoretic planning has focussedon making the solution of Markov decision processes (MDPs) more feasible. We develop a family of algorithms for structur...
SODA
2000
ACM
13 years 11 months ago
2000
ACM
: k-SAT is one of the best known among a wide class of random constraint satisfaction problems believed to exhibit a threshold phenomenon where the control parameter is the ratio, ...
COR
2010
13 years 10 months ago
2010
In this paper we study two formulation reductions for the quadratic assignment problem (QAP). In particular we apply these reductions to the well known Adams and Johnson [2] integ...