Sciweavers

850 search results - page 8 / 170
» Constraint propagation on quadratic constraints
Sort
View
CP
2004
Springer
14 years 26 days ago
A Domain Consistency Algorithm for the Stretch Constraint
The stretch constraint occurs in many rostering problems that arise in the industrial and public service sectors. In this paper we present an efficient algorithm for domain consist...
Lars Hellsten, Gilles Pesant, Peter van Beek
CPAIOR
2009
Springer
14 years 2 months ago
Learning How to Propagate Using Random Probing
Abstract. In constraint programming there are often many choices regarding the propagation method to be used on the constraints of a problem. However, simple constraint solvers usu...
Efstathios Stamatatos, Kostas Stergiou
ICASSP
2011
IEEE
12 years 11 months ago
Fast algorithm for beamforming problems in distributed communication of relay networks
A sequential quadratic programming (SQP) method is proposed to solve the distributed beamforming problem in multiple relay networks. The problem is formulated as the minimization ...
Cong Sun, Yaxiang Yuan
HEURISTICS
2006
148views more  HEURISTICS 2006»
13 years 7 months ago
On global warming: Flow-based soft global constraints
In case a CSP is over-constrained, it is natural to allow some constraints, called soft constraints, to be violated. We propose a generic method to soften global constraints that c...
Willem Jan van Hoeve, Gilles Pesant, Louis-Martin ...
CP
2007
Springer
14 years 1 months ago
Bound-Consistent Deviation Constraint
Deviation is a recent constraint to balance a set of variables with respect to a given mean. We show that the propagators recently introduced are not bound-consistent when the mean...
Pierre Schaus, Yves Deville, Pierre Dupont