A Probabilistic Beam Search Approach to the Shortest Common Supersequence Problem.
Christian BlumCarlos CottaAntonio J. FernándezJosé E. GallardoPublished in: EvoCOP (2007)
Keyphrases
- beam search
- shortest common supersequence
- branch and bound
- heuristic search
- search methods
- search algorithm
- larger problems
- assembly line
- hill climbing
- search problems
- bayesian networks
- probabilistic model
- np hard
- production planning and scheduling
- ranking functions
- neural network
- feature selection
- multi objective
- evolutionary algorithm
- artificial neural networks