711 search results - page 109 / 143 » Amalgams of Constraint Satisfaction Problems |
136
Voted
HM
2009
Springer
15 years 9 months ago
2009
Springer
We present a hybrid solver (called GELATO) that exploits the potentiality of a Constraint Programming (CP) environment (Gecode) and of a Local Search (LS) framework (EasyLocal++ )....
139
click to vote
ATAL
2003
Springer
15 years 9 months ago
2003
Springer
We present a new polynomial-space algorithm, called Adopt, for distributed constraint optimization (DCOP). DCOP is able to model a large class of collaboration problems in multi-a...
133
click to vote
ICLP
2004
Springer
15 years 9 months ago
2004
Springer
Arc-Consistency (AC) techniques have been used extensively in the study of Constraint Satisfaction Problems (CSP). These techniques are used to simplify the CSP before or during th...
154
click to vote
CP
2011
Springer
14 years 4 months ago
2011
Springer
We introduce tractable classes of VCSP instances based on convex cost functions. Firstly, we show that the class of VCSP instances satisfying the hierarchically nested convexity pr...
157
click to vote
VDB
1998
15 years 5 months ago
1998
In this paper we discuss how metaphors for supporting user interaction with multimedia databases can be automatically generated. The work presented is a further step in the develo...