239 search results - page 1 / 48 » The Parameterized Complexity of Global Constraints |
AAAI
2008
13 years 6 months ago
2008
We argue that parameterized complexity is a useful tool with which to study global constraints. In particular, we show that many global constraints which are intractable to propag...
AAAI
2008
13 years 6 months ago
2008
The study of random instances of NP complete and coNP complete problems has had much impact on our understanding of the nature of hard problems. In this work, we initiate an effor...
FTCGV
2006
13 years 4 months ago
2006
We present a survey of recent methods for creating piecewise linear mappings between triangulations in 3D and simpler domains such as planar regions, simplicial complexes, and sph...
CP
2005
Springer
13 years 10 months ago
2005
Springer
This paper presents a technique for learning parameterized implied constraints. They can be added to a model to improve the solving process. Experiments on implied Gcc constraints ...
CONSTRAINTS
2007
13 years 4 months ago
2007
