External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Beam-ACO for the Repetition-Free Longest Common Subsequence Problem

Christian Blum, Maria J. Blesa, Borja Calvo. Beam-ACO for the Repetition-Free Longest Common Subsequence Problem. In Pierrick Legrand, Marc-Michel Corsini, Jin-Kao Hao, Nicolas Monmarché, Evelyne Lutton, Marc Schoenauer, editors, Artificial Evolution - 11th International Conference, Evolution Artificielle, EA 2013, Bordeaux, France, October 21-23, 2013. Revised Selected Papers. Volume 8752 of Lecture Notes in Computer Science, pages 79-90, Springer, 2013. [doi]

Authors

Christian Blum

This author has not been identified. Look up 'Christian Blum' in Google

Maria J. Blesa

This author has not been identified. Look up 'Maria J. Blesa' in Google

Borja Calvo

This author has not been identified. Look up 'Borja Calvo' in Google
runs on