A memetic algorithm with bucket elimination for the still life problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3906 LNCS, Issue , 2006, Pages 73-85

  Gallardo, José E ^a   Cotta, Carlos ^a   Fernández, Antonio J ^a  

^a ETSI Informatica   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; CONSTRAINT THEORY; COSTS; EVOLUTIONARY ALGORITHMS; OPTIMIZATION;

BUCKET ELIMINATION (BE); CONSTRAINT SATISFACTION PROBLEMS; MEMETIC ALGORITHM (MA); STILL LIFE PROBLEMS;

HUMAN ENGINEERING;

EID: 33745804682     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11730095_7     Document Type: Conference Paper

References (13)

1. Gardner, M.: The fantastic combinations of John Conway's new solitaire game. Scientific American 223 (1970) 120-123
2. E.R. Berlekamp, J.C., Guy, R.: Winning Ways for your Mathematical Plays. Volume 2 of Games in Particular. Academic Press, London (1982)
3. Gardner, M.: On cellular automata, self-reproduction, the garden of Eden and the game of "life". Scientific American 224 (1971) 112-117
4. Gardner, M.: Wheels, Life, and Other Mathematical Amusements. W.H. Freeman, New York (1983)
5. Bosch, R., Trick, M.: Constraint programming and hybrid formulations for three life designs. In: CP-AI-OR. (2002) 77-91
6. Smith, B.M.: A dual graph translation of a problem in 'life'. In Hentenryck, P.V., ed.: 8th International Conference on Principles and Practice of Constraint Programming - CP'2002. Volume 2470 of Lecture Notes in Computer Science., Ithaca, NY, USA, Springer (2002) 402-414
7. Larrosa, J., Morancho, E., Niso, D.: On the practical use of variable elimination in constraint optimization problems: 'still life' as a case study. Journal of Artificial Intelligence Research 23 (2005) 421-440
8. Larrosa, J., Morancho, E.: Solving 'still life' with soft constraints and bucket elimination. In Rossi, F., ed.: Principles and Practice of Constraint Programming - CP 2003. Volume 2833 of Lecture Notes in Computer Science., Kinsale, Ireland, Springer (2003) 466-479
9. Bistarelli, S., Montanari, U., Rossi, F.: Semiring-based constraint satisfaction and optimization. Journal of the ACM 44 (1997) 201-236
10. Dechter, R.: Bucket elimination: A unifying framework for reasoning. Artificial Intelligence 113 (1999) 41-85
11. Radcliffe, N.: The algebra of genetic algorithms. Annals of Mathematics and Artificial Intelligence 10 (1994) 339-384
12. Downey, R., Fellows, M.: Fixed parameter tractability and completeness I: Basic theory. SIAM Journal of Computing 24 (1995) 873-921
13. Lehmann, E., D'Abrera, H.: Nonparametrics: Statistical Methods Based on Ranks. Prentice-Hall, Englewood Cliffs, NJ (1998)