1480 search results - page 124 / 296 » Ants can solve constraint satisfaction problems |
169
click to vote
AAAI
1992
15 years 7 months ago
1992
Constraint networks have been shown to be useful in formulating such diverse problems as scene labeling, natural language parsing, and temporal reasoning. Given a constraint netwo...
168
click to vote
ACL
1998
15 years 7 months ago
1998
We introduce a first-order language for semantic underspecification that we call Constraint Language for Lambda-Structures (CLLS). A Astructure can be considered as a A-term up to...
171
click to vote
AMW
2010
15 years 8 months ago
2010
We consider incomplete specifications of XML documents in the presence of schema information and integrity constraints. We show that integrity constraints such as keys and foreign ...
174
click to vote
IJCAI
2003
15 years 7 months ago
2003
Temporal Constraint Satisfaction Problems allow for reasoning with events happening over time. Their expressiveness has been extended independently in two directions: to account f...
151
click to vote
NIPS
2004
15 years 7 months ago
2004
Many interesting multiclass problems can be cast in the general framework of label ranking defined on a given set of classes. The evaluation for such a ranking is generally given ...