4117 search results - page 81 / 824 » On the Satisfiability of Complex Constraints |
164
click to vote
CIE
2009
Springer
16 years 27 days ago
2009
Springer
Let Γ be a (not necessarily finite) structure with a finite relational signature. We prove that deciding whether a given existential positive sentence holds in Γ is in LOGSPACE...
118
click to vote
ADCM
2008
15 years 6 months ago
2008
We consider the problem of constructing a C1 piecewise quadratic interpolant, Q, to positional and gradient data defined at the vertices of a tessellation of n-simplices in IRn . T...
165
click to vote
TON
2002
15 years 6 months ago
2002
Multiconstrained quality-of-service (QoS) routing deals with finding routes that satisfy multiple independent QoS constraints. This problem is NP-hard. In this paper, two heuristic...
192
click to vote
AI
2007
Springer
16 years 16 days ago
2007
Springer
Abstract. Variables and constraints in problem domains are often distributed. These distributed constraint satisfaction problems (DCSPs) lend themselves to multiagent solutions. Mo...
153
click to vote
CP
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. This report presents a generic filtering scheme, based on the graph description of global constraints. This description is defined by a network of binary constraints and ...