7139 search results - page 931 / 1428 » Language Engineering in Practice |
177
click to vote
CP
2005
Springer
16 years 18 days ago
2005
Springer
Many problems of theoretical and practical interest can be formulated as Constraint Satisfaction Problems (CSPs). The general CSP is known to be NP-complete; however, distributed m...
179
click to vote
CP
2005
Springer
16 years 18 days ago
2005
Springer
We introduce a novel and exciting research area: symmetrising levels of consistency to produce stronger forms of consistency and more efficient mechanisms for establishing them. W...
178
click to vote
CP
2005
Springer
16 years 18 days ago
2005
Springer
We propose a surprisingly simple new way of breaking all value symmetries with constraints. Our method requires the addition of one variable per value of the problem plus a linear ...
177
click to vote
CP
2005
Springer
16 years 18 days ago
2005
Springer
Besides search, complete inference methods can also be used to solve soft constraint problems. Their main drawback is the high spatial complexity. To improve its practical usage, w...
136
click to vote
CP
2005
Springer
16 years 18 days ago
2005
Springer
Abstract. The stable marriage problem (SM) and the Hospital / Residents problem (HR) are both stable matching problems. They consist of two sets of objects that need to be matched ...