Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
IWINAC
/
Paper
Memetic Algorithms with Partial Lamarckism for the Shortest Common Supersequence Problem.
Carlos Cotta
Venue
National
IWINAC
Year
2005
Proceedings
IWINAC (2)
DBLP record
conf/iwinac/Cotta05 ↗
Browse the full
IWINAC paper archive
.