380 search results - page 11 / 76 » Mapping Problems with Finite-Domain Variables into Problems ... |
DAC
2008
ACM
14 years 8 months ago
2008
ACM
Boolean function bi-decomposition is a fundamental operation in logic synthesis. A function f(X) is bi-decomposable under a variable partition XA, XB, XC on X if it can be written...
ECAI
2004
Springer
13 years 11 months ago
2004
Springer
Quantified Constraint Satisfaction Problems (QCSPs) are CSPs in which some variables are universally quantified. For each possible value of such variables, we have to find ways to ...
WWW
2005
ACM
14 years 8 months ago
2005
ACM
Semantic caching is an important technology for improving the response time of future user queries specified over remote servers. This paper deals with the fundamental query conta...
ICLP
2009
Springer
14 years 8 months ago
2009
Springer
We present an implementation of table constraints in CLP(FD). For binary constraints, the supports of each value are represented as a finite-domain variable, and action rules are u...
CVPR
2005
IEEE
14 years 9 months ago
2005
IEEE
This paper addresses the problem of reconstructing the geometry and color of a Lambertian scene, given some fully calibrated images acquired with wide baselines. In order to compl...