2974 search results - page 138 / 595 » Model-Driven Constraint Programming |
186
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
In this paper, we present a framework for automatic generation of CHR solvers given the logical specification of the constraints. This approach takes advantage of the power of tab...
153
click to vote
CSUR
2000
15 years 6 months ago
2000
: Constraint satisfaction programming (CSP) is a powerful paradigm for solving complex combinatorial problems, which has gained a lot of attention recently. Putting the power of co...
173
click to vote
FOCS
1990
IEEE
15 years 10 months ago
1990
IEEE
For any xed dimension d, the linear programming problem with n inequality constraints can be solved on a probabilistic CRCW PRAM with O(n) processors almost surely in constant time...
159
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
Abstract. We consider the issue of exploiting symmetries in the hierarchy of semidefinite programming relaxations recently introduced in polynomial optimization. We focus on probl...
155
click to vote
ICLP
2005
Springer
15 years 12 months ago
2005
Springer
Abduction is usually carried out on partially-defined predicates. In this paper we investigate abduction applied to fully-defined predicates, specifically linear arithmetic cons...