Beam-ACO for the repetition-free longest common subsequence problem (Q6487177)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6535476
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Beam-ACO for the repetition-free longest common subsequence problem |
scientific article; zbMATH DE number 6535476 |
Statements
Beam-ACO for the Repetition-Free Longest Common Subsequence Problem (English)
0 references
25 January 2016
0 references
0.8442392945289612
0 references
0.8099260926246643
0 references
0.8062946796417236
0 references
0.7925540804862976
0 references
0.7921676635742188
0 references
