7092 search results - page 315 / 1419 » Parallelizing constraint programs |
116
Voted
CP
2005
Springer
15 years 8 months ago
2005
Springer
We present a method for propagating linear constraints. Our technique exploits the fact that the interior point method converges on a central point of the polytope. A variable assi...
119
click to vote
BIRTHDAY
2008
Springer
15 years 4 months ago
2008
Springer
The semiring-based formalism to model soft constraint has been introduced in 1995 by Ugo Montanari and the authors of this paper. The idea was to make constraint programming more f...
115
Voted
IPL
2007
15 years 2 months ago
2007
We study a model that incorporates a budget constraint in a decision making problem. Our goal is to maximize the expected wealth, where in each time period we can either stop the ...
115
Voted
SIAMJO
2010
14 years 9 months ago
2010
We present a general semidefinite relaxation scheme for general n-variate quartic polynomial optimization under homogeneous quadratic constraints. Unlike the existing sum-of-squar...
132
Voted
SODA
2010
ACM
16 years 8 hour ago
2010
ACM
The class of constraint satisfactions problems (CSPs) captures many fundamental combinatorial optimization problems such as Max Cut, Max q-Cut, Unique Games, and Max k-Sat. Recent...