Sciweavers

7092 search results - page 80 / 1419
» Parallelizing constraint programs
Sort
View
CPAIOR
2006
Springer
15 years 4 months ago
A Totally Unimodular Description of the Consistent Value Polytope for Binary Constraint Programming
Abstract. We present a theoretical study on the idea of using mathematical programming relaxations for filtering binary constraint satisfaction problems. We introduce the consisten...
Ionut D. Aron, Daniel H. Leventhal, Meinolf Sellma...
COR
2006
98views more  COR 2006»
15 years 18 days ago
Exploiting semidefinite relaxations in constraint programming
Constraint programming uses enumeration and search tree pruning to solve combinatorial optimization problems. In order to speed up this solution process, we investigate the use of...
Willem Jan van Hoeve
90
Voted
AAAI
2007
15 years 2 months ago
Solving a Stochastic Queueing Design and Control Problem with Constraint Programming
A facility with front room and back room operations has the option of hiring specialized or, more expensive, cross-trained workers. Assuming stochastic customer arrival and servic...
Daria Terekhov, J. Christopher Beck, Kenneth N. Br...
SIAMJO
2000
108views more  SIAMJO 2000»
15 years 10 days ago
Smooth SQP Methods for Mathematical Programs with Nonlinear Complementarity Constraints
Mathematical programs with nonlinear complementarity constraints are reformulated using better-posed but nonsmooth constraints. We introduce a class of functions, parameterized by...
Houyuan Jiang, Daniel Ralph
143
Voted
AIME
2011
Springer
14 years 17 days ago
A Constraint Logic Programming Approach to Identifying Inconsistencies in Clinical Practice Guidelines for Patients with Comorbi
This paper describes a novel methodological approach to identifying inconsistencies when concurrently using multiple clinical practice guidelines. We discuss how to construct a for...
Martin Michalowski, Marisela Mainegra Hing, Szymon...