1051 search results - page 139 / 211 » Foundations of Constraint Satisfaction |
110
Voted
IJCAI
2003
15 years 2 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...
87
Voted
NAACL
2001
15 years 2 months ago
2001
This paper describes an approach to Machine Translation that places linguistic information at its foundation. The difficulty of translation from English to Japanese is illustrated...
125
click to vote
FOCM
2010
14 years 11 months ago
2010
We show how to approximate the feasible region of structured convex optimization problems by a family of convex sets with explicitly given and efficient (if the accuracy of the ap...
SAC
2009
ACM
15 years 7 months ago
2009
ACM
In this work, our objective is to heuristically discover a simplified form of functional dependencies between variables called weak dependencies. Once discovered, these relations...
105
Voted
CPAIOR
2007
Springer
15 years 6 months ago
2007
Springer
The Open-Shop Problem is a hard problem that can be solved using Constraint Programming or Operation Research methods. Existing techniques are efficient at reducing the search tree...