Login / Signup
A Beam Search for the Longest Common Subsequence Problem Guided by a Novel Approximate Expected Length Calculation.
Marko Djukanovic
Günther R. Raidl
Christian Blum
Published in:
LOD (2019)
Keyphrases
</>
beam search
search algorithm
larger problems
branch and bound
heuristic search
assembly line
search methods
search problems
hill climbing
ranking functions
neural network
search space
production planning and scheduling
web search
domain independent