Login / Signup
Anytime algorithms for the longest common palindromic subsequence problem.
Marko Djukanovic
Günther R. Raidl
Christian Blum
Published in:
Comput. Oper. Res. (2020)
Keyphrases
</>
anytime algorithms
dynamic programming
data streams
real time systems
pattern matching
solution quality
anytime classification
heuristic search algorithms
optimal solution
state space
markov decision problems
real time
search algorithm