Robust Solutions for Constraint Satisfaction and Optimization
暂无分享,去创建一个
[1] Emmanuel Hebrard,et al. Super Solutions in Constraint Programming , 2004, CPAIOR.
[2] Ian Miguel. Dynamic flexible constraint satisfaction and its application to AI planning , 2001 .
[3] Carme Torras,et al. Solving Strategies for Highly Symmetric CSPs , 1999, IJCAI.
[4] Jérôme Lang,et al. Uncertainty in Constraint Satisfaction Problems: a Probalistic Approach , 1993, ECSQARU.
[5] Richard J. Wallace,et al. Partial Constraint Satisfaction , 1989, IJCAI.
[6] Toby Walsh,et al. Breaking Row and Column Symmetries in Matrix Models , 2002, CP.
[7] J. Gaschnig. Performance measurement and analysis of certain search algorithms. , 1979 .
[8] Christopher Wilson,et al. Supermodels and Closed Sets , 2000, Electron. Colloquium Comput. Complex..
[9] Éric D. Taillard,et al. Benchmarks for basic scheduling problems , 1993 .
[10] Christian Bessiere,et al. MAC and Combined Heuristics: Two Reasons to Forsake FC (and CBJ?) on Hard Problems , 1996, CP.
[11] Toby Walsh,et al. Stochastic Constraint Programming , 2002, ECAI.
[12] Rainer Weigel,et al. On Reformulation of Constraint Satisfaction Problems , 1998, ECAI.
[13] Rina Dechter,et al. Belief Maintenance in Dynamic Constraint Networks , 1988, AAAI.
[14] Kenneth N. Brown,et al. Branching Constraint Satisfaction Problems for Solutions Robust under Likely Changes , 2000, CP.
[15] Patrice Boizumault,et al. Maintaining Arc-Consistency within Dynamic Backtracking , 2000, CP.
[16] Thomas Schiex,et al. Mixed Constraint Satisfaction: A Framework for Decision Problems under Incomplete Knowledge , 1996, AAAI/IAAI, Vol. 1.
[17] Eugene C. Freuder,et al. Contradicting Conventional Wisdom in Constraint Satisfaction , 1994, ECAI.
[18] Matthew L. Ginsberg,et al. Supermodels and Robustness , 1998, AAAI/IAAI.