Wordt geladen...
A Comparison of Evolutionary Approaches to the Shortest Common Supersequence Problem
The Shortest Common Supersequence problem is a hard combinatorial optimization problem with numerous practical applications. Several evolutionary approaches are proposed for this problem, considering the utilization of penalty functions, GRASP-based decoders, or repairing mechanisms. An empirical co...
Bewaard in:
| Gepubliceerd in: | Computational Intelligence and Bioinspired Systems |
|---|---|
| Hoofdauteur: | |
| Formaat: | Artigo |
| Taal: | Inglês |
| Gepubliceerd in: |
2005
|
| Onderwerpen: | |
| Online toegang: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7121053/ https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1007/11494669_7 |
| Tags: |
Voeg label toe
Geen labels, Wees de eerste die dit record labelt!
|