405 search results - page 34 / 81 » On the Complexity of Global Constraint Satisfaction |
137
click to vote
ECAI
2006
Springer
15 years 9 months ago
2006
Springer
Computer Supported Cooperative Work (CSCW) defines software tools and technology to support groups of people working together on a project, often at different sites [5]. In this wo...
168
click to vote
AAAI
1994
15 years 7 months ago
1994
We describe a method for learning formulas in firstorder logic using a brute-force, smallest-first search. The method is exceedingly simple. It generates all irreducible well-form...
178
click to vote
MATES
2009
Springer
16 years 20 days ago
2009
Springer
In constraint satisfaction, decomposition is a common technique to split a problem in a number of parts in such a way that the global solution can be efficiently assembled from th...
132
click to vote
CP
2003
Springer
15 years 11 months ago
2003
Springer
We provide a reformulation of the constraint hierarchies (CHs) framework based on the notion of error indicators. Adapting the generalized view of local consistency in semiring-ba...
164
click to vote
SEMCO
2007
IEEE
16 years 11 days ago
2007
IEEE
Many recent advances in complex domains such as Natural Language Processing (NLP) have taken a discriminative approach in conjunction with the global application of structural and...