Sciweavers

86 search results - page 5 / 18
» cp 2005
Sort
View
CP
2005
Springer
14 years 1 months ago
Applying Decomposition Methods to Crossword Puzzle Problems
Abstract. In this paper, we investigate the performance of several existing structural decomposition methods on fully interlocked Crossword Puzzle Problems (CPPs) and draw directio...
Yaling Zheng, Berthe Y. Choueiry
CP
2005
Springer
14 years 1 months ago
Lookahead Saturation with Restriction for SAT
We present a new and more efficient heuristic by restricting lookahead saturation (LAS) with NVO (neighbourhood variable ordering) and DEW (dynamic equality weighting). We report o...
Anbulagan, John K. Slaney
CP
2005
Springer
14 years 1 months ago
Acquiring Parameters of Implied Global Constraints
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 ...
Christian Bessière, Remi Coletta, Thierry P...
CP
2005
Springer
14 years 1 months ago
Solving Over-Constrained Problems with SAT
Abstract. We present a new generic problem solving approach for overconstrained problems based on Max-SAT. We first define a clausal form formalism that deals with blocks of clau...
Josep Argelich, Felip Manyà
CP
2005
Springer
14 years 1 months ago
Encoding Requests to Web Service Compositions as Constraints
Interacting with a web service enabled marketplace in order to achieve a complex task involves sequencing a set of individual service operations, gathering information from the ser...
Alexander Lazovik, Marco Aiello, Rosella Gennari