Sciweavers

1300 search results - page 120 / 260
» Constraint satisfaction problems and global cardinality cons...
Sort
View
AAAI
1997
14 years 11 months ago
Bayes Networks for Estimating the Number of Solutions to a CSP
The problem of counting the number of solutions to a constraint satisfaction problem (CSP) is rephrased in terms of probability updating in Bayes networks. Approximating the proba...
Amnon Meisels, Solomon Eyal Shimony, Gadi Solotore...
AAI
2006
106views more  AAI 2006»
14 years 10 months ago
Metaheuristics for Handling Time Interval Coverage Constraints in Nurse Scheduling
The problem of finding a high quality timetable for personnel in a hospital ward has been addressed by many researchers, personnel managers and schedulers over a number of years. ...
Edmund K. Burke, Patrick De Causmaecker, Sanja Pet...
CPAIOR
2009
Springer
15 years 4 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
CONSTRAINTS
2007
100views more  CONSTRAINTS 2007»
14 years 10 months ago
Design of Financial CDO Squared Transactions Using Constraint Programming
We give an approximate and often extremely fast method of building a particular kind of portfolio in finance, here called a portfolio design (PD), with applications in the credit ...
Pierre Flener, Justin Pearson, Luis G. Reyna, Olof...
JAIR
2010
145views more  JAIR 2010»
14 years 8 months ago
Fast Set Bounds Propagation Using a BDD-SAT Hybrid
Binary Decision Diagram (BDD) based set bounds propagation is a powerful approach to solving set-constraint satisfaction problems. However, prior BDD based techniques incur the si...
Graeme Gange, Peter J. Stuckey, Vitaly Lagoon