Using Relaxations in Maximum Density Still Life-Reference-Cited by-同舟云学术

Using Relaxations in Maximum Density Still Life

Published:2009 Issue: Volume: Page:258-273
ISSN:0302-9743
Container-title:Principles and Practice of Constraint Programming - CP 2009
language:
Short-container-title:

Author:

Chu Geoffrey,Stuckey Peter J.,de la Banda Maria Garcia

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-04244-7_22

Reference7 articles.

1. Bosch, R.: Integer programming and conway’s game of life. SIAM Review 41(3), 596–604 (1999)

2. Bosch, R., Trick, M.: Constraint programming and hybrid formulations for three life designs. In: Proceedings of the International Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CP-AI-OR 2002, pp. 77–91 (2002)

3. Dechter, R.: Constraint Processing. Morgan Kaufmann, San Francisco (2003)

4. Elkies, N.: The still-life density problem and its generalizations. arXiv:math/9905194v1

5. Elkies, N.: The still-life density problem and its generalizations. Voronoi’s Impact on Modern Science: Book I, 228–253 (1998), arXiv:math/9905194v1

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Generating custom propagators for arbitrary constraints;Artificial Intelligence;2014-06

2. A complete solution to the Maximum Density Still Life Problem;Artificial Intelligence;2012-06

3. Constraint Programming to Solve Maximal Density Still Life;Game of Life Cellular Automata;2010

4. Generating Special-Purpose Stateless Propagators for Arbitrary Constraints;Principles and Practice of Constraint Programming – CP 2010;2010