Memetic Algorithms with Partial Lamarckism for the Shortest Common Supersequence Problem

Carlos Cotta. Memetic Algorithms with Partial Lamarckism for the Shortest Common Supersequence Problem. In José Mira, José R. Álvarez, editors, Artificial Intelligence and Knowledge Engineering Applications: A Bioinspired Approach: First International Work-Conference on the Interplay Between Natural and Artificial Computation, IWINAC 2005, Las Palmas, Canary Islands, Spain, June 15-18, 2005, Proc. Volume 3562 of Lecture Notes in Computer Science, pages 84-91, Springer, 2005. [doi]

Abstract

Abstract is missing.