A multi-level memetic/exact hybrid algorithm for the still life problem

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

Volumn 4193 LNCS, Issue , 2006, Pages 212-221

  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; CONSTRAINT THEORY; HEURISTIC METHODS; MATHEMATICAL OPERATORS; METADATA; OPTIMIZATION; PROBLEM SOLVING;

BUCKET ELIMINATION (BE); MEMETIC ALGORITHM (MA); RECOMBINATION OPERATORS; VARIABLE ELIMINATION;

ALGORITHMS;

EID: 33750267730     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11844297_22     Document Type: Conference Paper

References (16)

1. Gardner, M.: The fantastic combinations of John Conway's new solitaire game. Scientific American 223 (1970) 120-123
2. Gardner, M.: On cellular automata, self-reproduction, the garden of Eden and the game of "life". Scientific American 224 (1971) 112-117
3. Gardner, M.: Wheels, Life, and Other Mathematical Amusements. W.H. Freeman, New York (1983)
4. Bosch, R., Trick, M.: Constraint programming and hybrid formulations for three life designs. In: CP-AI-OR. (2002) 77-91
5. Smith, B.M.: A dual graph translation of a problem in 'life'. In Hentenryck, P.V., ed.: Principles and Practice of Constraint Programming - CP'2002. Volume 2470 of Lecture Notes in Computer Science., Ithaca, NY, USA, Springer (2002) 402-414
6. 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
7. Cheng, K., Yap, R.: Ad-hoc global constraints for life. In van Beek, P., ed.: Principles and Practice of Constraint Programming - CP'2005. Volume 3709 of Lecture Notes in Computer Science., Sitges, Spain, Springer (2005) 182-195
8. Gallardo, J.E., Cotta, C., Fernández, A.J.: A memetic algorithm with bucket elimination for the still life problem. In Gottlieb, J., Raidl, G.R., eds.: EvoCOP. Volume 3906 of Lecture Notes in Computer Science., Springer (2006) 73-85
9. Eiben, A., Raue, P.E., Ruttkay, Z.: Genetic algorithms with multi-parent recombination. In Davidor, Y., Schwefel, H.P., Männer, R., eds.: Parallel Problem Solving From Nature III. Springer-Verlag (1994) 78-87, LNCS 866
10. Dechter, R.: Bucket elimination: A unifying framework for reasoning. Artificial Intelligence 113 (1999) 41-85
11. Bistarelli, S., Montanari, U., Rossi, F.: Semiring-based constraint satisfaction and optimization. Journal of the ACM 44 (1997) 201-236
12. Radcliffe, N.: The algebra of genetic algorithms. Annals of Mathematics and Artificial Intelligence 10 (1994) 339-384
13. 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
14. Dechter, R., Pearl, J.: Tree clustering for constraint networks. Artificial Intelligence (1989) 353-366
15. Gallardo, J., Cotta, C., Fernández, A.: On the hybridization of memetic algorithms with branch-and-bound techniques. IEEE Transactions on Systems, Man and Cybernetics, part B (2006) (to appear).
16. Dechter, R.: Mini-buckets: A general scheme for generating approximations in automated reasoning. In: Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, Nagoya, Japan, Morgan Kaufmann (1997) 1297-1303