Sciweavers

403 search results - page 21 / 81
» Variable ranges in linear constraints
Sort
View
SAGA
2001
Springer
14 years 26 days ago
Yet Another Local Search Method for Constraint Solving
We propose a generic, domain-independent local search method called adaptive search for solving Constraint Satisfaction Problems (CSP). We design a new heuristics that takes advan...
Philippe Codognet, Daniel Diaz
CORR
2010
Springer
130views Education» more  CORR 2010»
13 years 8 months ago
Decomposition of the NVALUE constraint
We study decompositions of the global NVALUE constraint. Our main contribution is theoretical: we show that there are propagators for global constraints like NVALUE which decomposi...
Christian Bessiere, George Katsirelos, Nina Narody...
CORR
2010
Springer
173views Education» more  CORR 2010»
13 years 8 months ago
Automatic Modular Abstractions for Template Numerical Constraints
c Modular Abstractions for Template Numerical Constraints David Monniaux May 26, 2010 We propose a method for automatically generating abstract transformstatic analysis by abstrac...
David Monniaux
TVCG
2010
161views more  TVCG 2010»
13 years 6 months ago
Globally Optimized Linear Windowed Tone Mapping
—This paper introduces a new tone mapping operator that performs local linear adjustments on small overlapping windows over the entire input image. While each window applies a lo...
Qi Shan, Jiaya Jia, Michael S. Brown
COCO
2011
Springer
216views Algorithms» more  COCO 2011»
12 years 8 months ago
Linear Systems over Finite Abelian Groups
We consider a system of linear constraints over any finite Abelian group G of the following form: i(x1, . . . , xn) ≡ i,1x1 + · · · + i,nxn ∈ Ai for i = 1, . . . , t and e...
Arkadev Chattopadhyay, Shachar Lovett