285 search results - page 23 / 57 » The complexity of soft constraint satisfaction |
ATAL
2003
Springer
15 years 5 months ago
2003
Springer
In this paper we present a cooperative negotiation protocol that solves a distributed resource allocation problem while conforming to soft real-time constraints in a dynamic envir...
184
click to vote
CP
2009
Springer
16 years 13 days ago
2009
Springer
The Valued Constraint Satisfaction Problem (VCSP) is a general framework encompassing many optimisation problems. We discuss precisely what it means for a problem to be modelled in...
AGI
2008
15 years 1 months ago
2008
Whereas symbol
111
click to vote
SIAMDM
2010
14 years 10 months ago
2010
For a fixed graph H, let Ret(H) denote the problem of deciding whether a given input graph is retractable to H. We classify the complexity of Ret(H) when H is a graph (with loops ...
CSL
2010
Springer
15 years 27 days ago
2010
Springer
We study the complexity of evaluating positive equality-free sentences of first-order (FO) logic over fixed, finite structures B. This may be seen as a natural generalisation of th...