In Search of Balance: The Challenge of Generating Balanced Latin Rectangles
暂无分享,去创建一个
[1] Bart Selman,et al. Low-density Parity Constraints for Hashing-Based Discrete Integration , 2014, ICML.
[2] Bart Selman,et al. Model Counting: A New Strategy for Obtaining Good Bounds , 2006, AAAI.
[3] Ian P. Gent,et al. Symmetry Breaking in Constraint Programming , 2000, ECAI.
[4] Ronan Le Bras,et al. Polynomial Time Construction for Spatially Balanced Latin Squares , 2012 .
[5] Bart Selman,et al. Counting CSP Solutions Using Generalized XOR Constraints , 2007, AAAI.
[6] Toby Walsh,et al. Handbook of Constraint Programming , 2006, Handbook of Constraint Programming.
[7] Ronan Le Bras,et al. From Streamlined Combinatorial Search to Efficient Constructive Procedures , 2012, AAAI.
[8] Cèsar Fernández,et al. Streamlining Local Search for Spatially Balanced Latin Squares , 2005, IJCAI.
[9] C. L. van Es,et al. Spatial Nature of Randomization and Its Effect on the Outcome of Field Experiments , 1993 .
[10] Pascal Van Hentenryck,et al. Differentiable Invariants , 2006, CP.
[11] Meinolf Sellmann,et al. The Challenge of Generating Spatially Balanced Scientific Experiment Designs , 2004, CPAIOR.
[12] Meinolf Sellmann,et al. Symmetry Breaking , 2001, CP.
[13] Jörg Hoffmann,et al. Short XORs for Model Counting: From Theory to Practice , 2007, SAT.
[14] Meinolf Sellmann,et al. Streamlined Constraint Reasoning , 2004, CP.