706 search results - page 5 / 142 » Super Solutions in Constraint Programming |
CP
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. Subquadrangles are a natural way in which to represent constraints as they do not restrict any subset of their scope. There are already known methods for converting any g...
CPAIOR
2010
Springer
15 years 4 months ago
2010
Springer
We present a new method to compute upper bounds of the number of solutions of binary integer programming (BIP) problems. Given a BIP, we create a dynamic programming (DP) table for...
ICVGIP
2008
15 years 1 months ago
2008
Constructing a high-resolution (HR) image from lowresolution (LR) image(s) has been a very active research topic recently with focus shifting from multi-frames to learning based s...
MP
2011
14 years 2 months ago
2011
Abstract. Using the least element solution of the P0 and Z matrix linear complementarity problem (LCP), we define an implicit solution function for linear complementarity constrai...
AAAI
2007
15 years 1 months ago
2007
We present a general framework for determining the number of solutions of constraint satisfaction problems (CSPs) with a high precision. Our first strategy uses additional binary...