Sciweavers

1264 search results - page 18 / 253
» The framework approach for constraint satisfaction
Sort
View
CSR
2006
Springer
15 years 5 months ago
The Complexity of Equality Constraint Languages
We classify the computational complexity of all constraint satisfaction problems where the constraint language is preserved by all permutations of the domain. A constraint languag...
Manuel Bodirsky, Jan Kára
AAAI
1994
15 years 3 months ago
GENET: A Connectionist Architecture for Solving Constraint Satisfaction Problems by Iterative Improvement
New approaches to solving constraint satisfaction problems using iterative improvement techniques have been found to be successful on certain, very large problems such as the mill...
Andrew J. Davenport, Edward P. K. Tsang, Chang J. ...
106
Voted
COLING
2002
15 years 1 months ago
From Shallow to Deep Parsing Using Constraint Satisfaction
We present in this paper a technique allowing to choose the parsing granularity within the same approach relying on a constraint-based formalism. Its main advantage lies in the fa...
Jean-Marie Balfourier, Philippe Blache, Tristan va...
ECAI
2006
Springer
15 years 5 months ago
Decision with Uncertainties, Feasibilities, and Utilities: Towards a Unified Algebraic Framework
Several formalisms exist to express and solve decision problems. Each is designed to capture different kinds of knowledge: utilities expressing preferences, uncertainties on the en...
Cédric Pralet, Gérard Verfaillie, Th...
SARA
2007
Springer
15 years 8 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...