1968 search results - page 177 / 394 » The Complexity of Valued Constraint Models |
ICLP
2010
Springer
15 years 5 months ago
2010
Springer
We define the Tight Semantics (TS), a new semantics for all NLPs complying with the requirements of: 2-valued semantics; preserving the models of SM; guarantee of model existence...
113
click to vote
IAT
2003
IEEE
15 years 7 months ago
2003
IEEE
Facing great challenges in designing better assistive technology with ever more complex and pervasive IT systems we need a general change in our understanding of designing IT. Way...
130
click to vote
PDP
2003
IEEE
15 years 7 months ago
2003
IEEE
We consider the execution of a complex application on a heterogeneous "grid" computing platform. The complex application consists of a suite of identical, independent pr...
143
click to vote
ATAL
2008
Springer
15 years 3 months ago
2008
Springer
Complete algorithms have been proposed to solve problems modelled as distributed constraint optimization (DCOP). However, there are only few attempts to address real world scenari...
226
click to vote
ICDT
2010
ACM
15 years 11 months ago
2010
ACM
We consider a fragment of XPath named `forward-XPath', which contains all descendant and rightwards sibling axes as well as data equality and inequality tests. The satisfiabi...