Sciweavers

2702 search results - page 40 / 541
» constraints 2008
Sort
View
88
Voted
DAGSTUHL
2008
14 years 11 months ago
Recent Results on the Algebraic Approach to the CSP
Abstract. We describe an algebraic approach to the constraint satisfaction problem (CSP) and present recent results on the CSP that make use of, in an essential way, this algebraic...
Andrei A. Bulatov, Matthew Valeriote
CP
2008
Springer
14 years 11 months ago
Semi-automatic Generation of CHR Solvers for Global Constraints
Constraint programming often involves global constraints, for which various custom filtering algorithms have been published. This work presents a semi-automatic generation of CHR s...
Frank Raiser
69
Voted
COR
2008
112views more  COR 2008»
14 years 9 months ago
Bi-dynamic constraint aggregation and subproblem reduction
Dynamic constraint aggregation was recently introduced by Elhallaoui et al. [Dynamic aggregation of set partitioning constraints in column generation. Operations Research 2005; 53...
Issmail Elhallaoui, Guy Desaulniers, Abdelmoutalib...
TIT
2008
84views more  TIT 2008»
14 years 9 months ago
Cooperative Multiple-Access Encoding With States Available at One Transmitter
Abstract--We generalize the Gel'fand
Anelia Somekh-Baruch, Shlomo Shamai, Sergio Verd&u...
68
Voted
DAGSTUHL
2008
14 years 11 months ago
Constraint Satisfaction Problems with Infinite Templates
Allowing templates with infinite domains greatly expands the range of problems that can be formulated as a non-uniform constraint satisfaction problem. It turns out that many CSPs ...
Manuel Bodirsky