A Relative Value Function Based Learning Beam Search for Longest Common Subsequence Problems

Abstract

Full Citation:

Marc Huber, Günther R. Raidl. A Relative Value Function Based Learning Beam Search for Longest Common Subsequence Problems. Chapter in Extended Abstracts of the 18th International Conference on Computer Aided Systems Theory – EUROCAST 2022 (Alexis Quesada-Arencibia, others, eds.), pages 22–23, 2022.

Günther Raidl
Günther Raidl

Günther Raidl is a Professor at the Algorithms and Complexity Group.