Constraint-directed search for all-interval series
暂无分享,去创建一个
[1] Toby Walsh,et al. Parameterized Complexity Results in Symmetry Breaking , 2010, IPEC.
[2] Barbara M. Smith,et al. Symmetry Breaking in Graceful Graphs , 2003, CP.
[3] Philippe Codognet,et al. Yet Another Local Search Method for Constraint Solving , 2001, SAGA.
[4] Scott E. Hudson,et al. Incremental attribute evaluation: a flexible algorithm for lazy update , 1991, TOPL.
[5] Christine Solnon,et al. Solving Permutation Constraint Satisfaction Problems with Artificial Ants , 2000, ECAI.
[6] H. Simonis. A Note on CSPLIB prob007 , 2008 .
[7] 柴田 南雄,et al. ニューグローヴ世界音楽大事典 = The new Grove dictionary of music and musicians , 1879 .
[8] Nicolas Beldiceanu,et al. Introducing global constraints in CHIP , 1994 .
[9] Remzi H. Arpaci-Dusseau. Operating Systems: Three Easy Pieces , 2015, login Usenix Mag..
[10] J. Maitland. Grove's Dictionary of Music and Musicians , 1905 .
[11] Holger H. Hoos,et al. Stochastic local search - methods, models, applications , 1998, DISKI.
[12] Martin Gebser,et al. The Conflict-Driven Answer Set Solver clasp: Progress Report , 2009, LPNMR.
[13] Ramón Béjar,et al. Regular-SAT: A many-valued approach to solving combinatorial problems , 2007, Discret. Appl. Math..
[14] Michal Adamaszek. Efficient enumeration of graceful permutations , 2006 .
[15] Claude-Guy Quimper,et al. Parallel Discrepancy-Based Search , 2013, CP.
[16] Jacquelyn Banks. An Introduction to Client/Server Computing , 1993, Int. CMG Conference.
[17] Stefan Maierhofer,et al. Lazy incremental computation for efficient scene graph rendering , 2013, HPG '13.
[18] Robert E. Mercer,et al. Minimal forward checking , 1994, Proceedings Sixth International Conference on Tools with Artificial Intelligence. TAI 94.
[19] J. Christopher Beck. Principles and Practice of Constraint Programming , 2017, Lecture Notes in Computer Science.
[20] Van-Hau Nguyen,et al. Solving the all-interval series problem: SAT vs CP , 2014, SoICT.
[21] Philippe Codognet,et al. Prediction of Parallel Speed-Ups for Las Vegas Algorithms , 2012, 2013 42nd International Conference on Parallel Processing.
[22] Teresa Alsinet,et al. Minimal and Redundant SAT Encodings for the All-Interval-Series Problem , 2002, CCIA.
[23] Camilo Rueda,et al. Gelisp: A Library to Represent Musical CSPs and Search Strategies , 2015, ArXiv.
[24] Dale Schuurmans,et al. Local search characteristics of incomplete SAT procedures , 2000, Artif. Intell..
[25] Michael J. Maher,et al. Kangaroo: An Efficient Constraint-Based Local Search System Using Lazy Propagation , 2011, CP.