419 search results - page 60 / 84 » An LP-Designed Algorithm for Constraint Satisfaction |
CP
2011
Springer
12 years 8 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...
WWW
2007
ACM
14 years 9 months ago
2007
ACM
Schema statements in OWL are interpreted quite differently from analogous statements in relational databases. If these statements are meant to be interpreted as integrity constrai...
HM
2009
Springer
14 years 1 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++ )....
CP
2008
Springer
13 years 10 months ago
2008
Springer
ABT is the reference algorithm for asynchronous distributed constraint satisfaction. When searching, ABT produces nogoods as justifications of deleted values. When one of such nogo...
NPL
1998
13 years 8 months ago
1998
Adaptive artificial neural network techniques are introduced and applied to the factorization of 2-D second order polynomials. The proposed neural network is trained using a const...