349 search results - page 7 / 70 » Semiring-Based Soft Constraints |
175
click to vote
ACL
2009
15 years 3 months ago
2009
We formulate the problem of nonprojective dependency parsing as a polynomial-sized integer linear program. Our formulation is able to handle non-local output features in an effici...
133
click to vote
ICCBR
2003
Springer
15 years 11 months ago
2003
Springer
In [1] we propose interchangeability based algorithms as methods for solving the case adaptation for the domain of problems which can be expressed as Constraint Satisfaction Proble...
163
click to vote
MICAI
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Classical constraint satisfaction problems (CSPs) provide an expressive formalism for describing and solving many real-world problems. However, classical CSPs prove to be...
155
click to vote
CPAIOR
2006
Springer
15 years 7 months ago
2006
Springer
As many real-world problems involve user preferences, costs, or probabilities, constraint satisfaction has been extended to optimization by generalizing hard constraints to soft co...