Sciweavers

151 search results - page 3 / 31
» Experimental Evaluation of Preprocessing Techniques in Const...
Sort
View
IJCAI
1989
13 years 9 months ago
Constraint Satisfaction with Delayed Evaluation
This paper describes the design and implementation of a constraint satisfaction system that uses delayed evaluation techniques to provide greater representational power and to avo...
Monte Zweben, Megan Eskey
SARA
2007
Springer
14 years 2 months ago
Reformulating Constraint Satisfaction Problems to Improve Scalability
Constraint Programming is a powerful approach for modeling and solving many combinatorial problems, scalability, however, remains an issue in . Abstraction and reformulation techni...
Kenneth M. Bayer, Martin Michalowski, Berthe Y. Ch...
PROCEDIA
2011
12 years 10 months ago
Exact Closest String as a Constraint Satisfaction Problem
We report the first evaluation of Constraint Satisfaction as a computational framework for solving closest string problems. We show that careful consideration of symbol occurrenc...
Tom Kelsey, Lars Kotthoff
ASE
1998
81views more  ASE 1998»
13 years 7 months ago
Program Understanding as Constraint Satisfaction: Representation and Reasoning Techniques
The process of understanding a source code in a high-level programming language involves complex computation. Given a piece of legacy code and a library of program plan templates, ...
Steven G. Woods, Qiang Yang
AAAI
1998
13 years 9 months ago
On the Conversion between Non-Binary and Binary Constraint Satisfaction Problems
It is well known that any non-binary discrete constraint satisfaction problem (CSP) can be translated into an equivalent binary CSP. Two translations are known: the dual graph tra...
Fahiem Bacchus, Peter van Beek