On the stochastic constraint satisfaction framework

Proceedings of the ACM Symposium on Applied Computing

Volumn , Issue , 2007, Pages 316-320

  Bordeaux, Lucas ^a   Samulowitz, Horst ^b  

^a MICROSOFT RESEARCH   (United Kingdom)

^b UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; DECISION MAKING; ONLINE SEARCHING; POLYNOMIALS; PROBLEM SOLVING;

MULTI OBJECTIVE DECISION MAKING; NONSEQUENTIAL FORMS; SEARCH ALGORITHMS; STOCHASTIC CONSTRAINT SATISFACTION;

STOCHASTIC PROGRAMMING;

EID: 35248822132     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1244002.1244077     Document Type: Conference Paper

References (6)

1. T. Balafoutis and K. Stergiou. Algorithms for stochastic CSP. In Proc. of Int. Conf. on Principles and Practice of Constraint Programming (CP), pages 44-58. Springer, 2006.
2. K. M. Brown and I. Miguel. Uncertainty and change. In F. Rossi, P. Van Beek, and T. Walsh, editors, Handbook of Constraint Programming, chapter 21. Elsevier, 2006.
3. M. L. Littman, S. M. Majercik, and T. Pitassi. Stochastic boolean satisfiability. J. of Automated Reasoning, 27(3):251-296, 2001.
4. C. Papadimitriou. Games against nature. J. of Computer and System Sciences, 31(2):288-301, 1985.
5. A. Tarim, S. Manandhar, and T. Walsh. Stochastic constraint programming: A scenario-based approach. Constraints, 11(1):53-80, 2006.
6. T. Walsh. Stochastic constraint programming. In Proc. of Euro. Conf. on Artificial Intelligence (ECAI), pages 111-115. John Wiley and Sons, 2002.