1381 search results - page 49 / 277 » Computational Complexity of Constraint Satisfaction |
114
click to vote
COLCOM
2005
IEEE
15 years 9 months ago
2005
IEEE
Multi-way dataflow constraints are very useful in the development of collaborative applications, such as collaborative CAD and CASE systems, but satisfying multi-way dataflow cons...
135
Voted
COMPSAC
2008
IEEE
15 years 10 months ago
2008
IEEE
We discuss the suitability of service-oriented computing for the automotive domain. We present a formal high-level language in which complex automotive activities can be modelled ...
195
Voted
CCA
2009
Springer
15 years 8 months ago
2009
Springer
Interval computations estimate the uncertainty of the result of data processing in situations in which we only know the upper bounds ∆ on the measurement errors. In this case, ba...
134
Voted
CP
2008
Springer
15 years 5 months ago
2008
Springer
We introduce the SoftAllEqual global constraint, which maximizes the number of equalities holding between pairs of assignments to a set of variables. We study the computational com...
127
Voted
WG
2004
Springer
15 years 9 months ago
2004
Springer
The clique problem consists in determining whether an undirected graph G of order n contains a clique of order . In this paper we are concerned with the decremental version of cliq...