A carregar...
A Probabilistic Beam Search Approach to the Shortest Common Supersequence Problem
The Shortest Common Supersequence Problem (SCSP) is a well-known hard combinatorial optimization problem that formalizes many real world problems. This paper presents a novel randomized search strategy, called probabilistic beam search (PBS), based on the hybridization between beam search and greedy...
Na minha lista:
| Publicado no: | Evolutionary Computation in Combinatorial Optimization |
|---|---|
| Main Authors: | , , , |
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
2007
|
| Assuntos: | |
| Acesso em linha: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7120107/ https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1007/978-3-540-71615-0_4 |
| Tags: |
Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!
|