A Beam Search for the Longest Common Subsequence Problem Guided by a Novel Approximate Expected Length Calculation

Naslov

A Beam Search for the Longest Common Subsequence Problem Guided by a Novel Approximate Expected Length Calculation

Identifikator

/unibl/sci/idNaucniRad:28191
info:doi/https://doi.org/10.1007/978-3-030-37599-7_14

Tip

Pronađite slične unoseConference Paper
Pronađite slične unosetext

Datum

Pronađite slične unose2020-09

Bibliografski citat

M. Đukanović, G. Raidl, C. Blum, A Beam Search for the Longest Common Subsequence Problem Guided by a Novel Approximate Expected Length Calculation, LNCS, pp. 154 - 167, Sep, 2020

Početna stranica

154

Krajnja stranica

167

Prezentovano

The 5th Conference on Machine Learning, Optimization and Data science

Je dio

LNCS

Veza

Pronađite slične unosePrirodno-matematički fakultet

Lista autora

Pronađite slične unoseMarko Đukanović
Pronađite slične unoseGuenther Raidl
Pronađite slične unoseChristian Blum

Position: 5737 (161 views)