On the practical use of variable elimination in constraint optimization problems: 'Still-life' as a case study

Journal of Artificial Intelligence Research

Volumn 23, Issue , 2005, Pages 421-440

  Larrosa, Javier ^a   Morancho, Enric ^a   Niso, David ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; ONLINE SEARCHING; PROBLEM SOLVING; QUALITY CONTROL;

HIGH SPACE COMPLEXITY; OPTIMIZATION PROBLEMS; STAND-ALONE ALGORITHM;

ARTIFICIAL INTELLIGENCE;

EID: 27344446696     PISSN: 10769757     EISSN: 10769757     Source Type: Journal    
DOI: 10.1613/jair.1541     Document Type: Article

References (18)

1. Bensana, E., Lemaitre, M., & Verfaillie, G. (1999). Earth observation satellite management. Constraints, 4(3), 293-299.
2. Bertele, U., & Brioschi, F. (1972). Nonserial Dynamic Programming. Academic Press.
3. Bistarelli, S., Montanari, U., & Rossi, F. (1997). Semiring-based constraint satisfaction and optimization. Journal of the ACM, 44(2), 201-236.
4. Bosch, R., & Trick, M. (2002). 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'02, pp. 77-91.
5. Gabon, B., de Givry, S., Lobjois, L., Schiex, T., & Warners, J. (1999). Radio link frequency assignment. Constraints, 4, 79-89.
6. th CP, pp. 363-376, Kinsale, Ireland. LNCS 2833. Springer Verlag.
7. Dechter, R. (1999). Bucket elimination: A unifying framework for reasoning. Artificial Intelligence, 113, 41-85.
8. Dechter, R., & Pearl, J. (1989). Tree clustering for constraint networks. Artificial Intelligence, 38, 353-366.
9. Dechter, R., & Fatah, Y. E. (2001). Topological parameters for time-space tradeoff. Artificial Intelligence, 125(1-2), 93-118.
10. Dechter, R., & Rish, I. (2003). Mini-buckets: A general scheme for bounded inference. Journal of the ACM, 50(2), 107-153.
11. Gardner, M. (1970). The fantastic combinations of John conway's new solitary game. Scientific American, 223, 120-123.
12. th CP, pp. 262-277, Singapore. LNCS 1894. Springer Verlag.
13. Kask, K., & Dechter, R. (2001). A general scheme for automatic generation of search heuristics from specification dependencies. Artificial Intelligence, 129, 91-131.
14. Larrosa, J., & Dechter, R. (2003). Boosting search with variable elimination in constraint optimization and constraint satisfaction problems. Constraints, 8(3), 303-326.
15. th IJCAI, Acapulco, Mexico.
16. Pearl, J. (1988). Probabilistic Inference in Intelligent Systems. Networks of Plausible Inference. Morgan Kaufmann, San Mateo, CA.
17. Sandholm, T. (1999). An algorithm for optimal winner determination in combinatorial auctions. In IJCAI-99, pp. 542-547.
18. Smith, B. (2002). A dual graph translation of a problem in life. In Proc. of CP-2002, pp. 0-1, Ithaca, USA. LNCS. Springer Verlag.