Probabilistic Beam Search for the Longest Common Subsequence Problem.
Christian BlumMaria J. BlesaPublished in: SLS (2007)
Keyphrases
- beam search
- branch and bound
- heuristic search
- larger problems
- search algorithm
- search methods
- assembly line
- ranking functions
- hill climbing
- bayesian networks
- information retrieval
- probabilistic model
- decision trees
- data structure
- search problems
- production planning and scheduling
- domain independent
- state space
- cost function
- lower bound