A carregar...

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...

ver descrição completa

Na minha lista:
Detalhes bibliográficos
Publicado no:Computational Intelligence and Bioinspired Systems
Autor principal: Cotta, Carlos
Formato: Artigo
Idioma:Inglês
Publicado em: 2005
Assuntos:
Acesso em linha:https://ncbi.nlm.nih.gov/pmc/articles/PMC7121053/
https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1007/11494669_7
Tags: Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!