2861 search results - page 34 / 573 » Constraint Programming |
ICLP
2005
Springer
15 years 3 months ago
2005
Springer
We present a version of the CCP paradigm, which is both distributed and probabilistic. We consider networks with a fixed number of nodes, each of them possessing a local and indep...
MOR
2006
14 years 9 months ago
2006
For a locally optimal solution to the nonlinear semidefinite programming problem, under Robinson's constraint qualification, the following conditions are proved to be equival...
CPAIOR
2004
Springer
15 years 3 months ago
2004
Springer
To improve solution robustness, we introduce the concept of super solutions to constraint programming. An (a, b)-super solution is one in which if a variables lose their values, th...
CP
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. VLSI chips design is becoming increasingly complex and calling for more and more automation. Many chip design problems can be formulated naturally as constraint problems ...
CORR
2010
Springer
14 years 8 months ago
2010
Springer
We show that global constraints on finite domains like alldifferent can be reformulated into answer set programs on which we achieve arc, bound or range consistency. These reform...