Enumeration Strategies for Solving Constraint Satisfaction Problems: A Performance Evaluation
暂无分享,去创建一个
Broderick Crawford | Ricardo Soto | Franklin Johnson | Fernando Paredes | Rodrigo Olivares | Rodrigo Herrera | Ricardo Soto | Broderick Crawford | F. Paredes | Franklin Johnson | Rodrigo Olivares | Rodrigo Herrera
[1] Krzysztof R. Apt,et al. Principles of constraint programming , 2003 .
[2] Bruce W. Westbury. SEXTONIONS AND THE MAGIC SQUARE , 2006 .
[3] Broderick Crawford,et al. A hybrid AC3-tabu search algorithm for solving Sudoku puzzles , 2013, Expert Syst. Appl..
[4] Frédéric Saubion,et al. A Generic Framework for Local Search: Application to the Sudoku Problem , 2006, International Conference on Computational Science.
[5] Roy O. Davies,et al. On Langford’s Problem (II) , 1959, The Mathematical Gazette.
[6] E. J. Hoffman,et al. Constructions for the Solution of the m Queens Problem , 1969 .
[7] John J. Borkowski,et al. Network inclusion probabilities and Horvitz-Thompson estimation for adaptive simple Latin square sampling , 1999, Environmental and Ecological Statistics.
[8] Broderick CRAWFORD,et al. Dynamic selection of enumeration strategies for solving constraint satisfaction problems , 2012 .
[9] Toby Walsh,et al. Handbook of Constraint Programming , 2006, Handbook of Constraint Programming.
[10] Shun-Shii Lin,et al. Optimal algorithms for constructing knight's tours on arbitrary n?m chessboards , 2005, Discret. Appl. Math..