-Based Compilation of Relaxed Decision Diagrams for the Longest Common Subsequence Problem.
Matthias HornGünther R. RaidlPublished in: CPAIOR (2021)
Keyphrases
- decision diagrams
- beam search
- search algorithm
- multi valued
- markov decision processes
- binary decision diagrams
- branch and bound
- digital circuits
- efficient computation
- heuristic search
- knowledge compilation
- planning problems
- hill climbing
- search problems
- optimal solution
- search methods
- constraint satisfaction problems
- ranking functions
- boolean functions
- compressed data