A carregar...
Memetic Algorithms with Partial Lamarckism for the Shortest Common Supersequence Problem
The Shortest Common Supersequence problem is a hard combinatorial optimization problem with numerous practical applications. We consider the use of memetic algorithms (MAs) for solving this problem. A specialized local-improvement operator based on character removal and heuristic repairing plays a c...
Na minha lista:
| Publicado no: | Artificial Intelligence and Knowledge Engineering Applications: A Bioinspired Approach |
|---|---|
| Autor principal: | |
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
2005
|
| Assuntos: | |
| Acesso em linha: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7121528/ https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1007/11499305_9 |
| Tags: |
Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!
|