405 search results - page 34 / 81 » On the Complexity of Global Constraint Satisfaction |
67
Voted
ECAI
2006
Springer
15 years 2 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...
AAAI
1994
15 years 12 days 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...
111
click to vote
MATES
2009
Springer
15 years 5 months 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...
CP
2003
Springer
15 years 4 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...
SEMCO
2007
IEEE
15 years 5 months 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...