Ładuje się......
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...
Zapisane w:
| Wydane w: | Artificial Intelligence and Knowledge Engineering Applications: A Bioinspired Approach |
|---|---|
| 1. autor: | |
| Format: | Artigo |
| Język: | Inglês |
| Wydane: |
2005
|
| Hasła przedmiotowe: | |
| Dostęp online: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7121528/ https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1007/11499305_9 |
| Etykiety: |
Dodaj etykietę
Nie ma etykietki, Dołącz pierwszą etykiete!
|