In computer science, beam search is a heuristic search algorithm that explores a graph by expanding the most promising node in a limited set. Beamâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2012

2012

- Tristan Cazenave
- IEEE Transactions on Computational Intelligenceâ€¦
- 2012

Monte Carlo tree search is the state of the art for multiple games and for solving puzzles such as Morpion Solitaire. Nestedâ€¦Â (More)

Is this relevant?

Highly Cited

2011

Highly Cited

2011

- Yue Zhang, Stephen Clark
- Computational Linguistics
- 2011

We study a range of syntactic processing tasks using a general statistical framework that consists of a global linear modelâ€¦Â (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- David Furcy, Sven Koenig
- IJCAI
- 2005

Beam search reduces the memory consumption of bestfirst search at the cost of finding longer paths but its memory consumption canâ€¦Â (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- Rong Zhou, Eric A. Hansen
- ICAPS
- 2005

We describe a method for transforming beam search into a complete search algorithm that is guaranteed to find an optimal solutionâ€¦Â (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- Christian Blum
- Computers & OR
- 2005

Ant colony optimization (ACO) is a metaheuristic approach to tackle hard combinatorial optimization problems. The basic componentâ€¦Â (More)

Is this relevant?

2004

2004

- Federico Della Croce, Marco Ghirardi, Roberto Tadei
- J. Heuristics
- 2004

A hybrid heuristic method for combinatorial optimization problems is proposed that combines di erent classical techniques such asâ€¦Â (More)

Is this relevant?

Highly Cited

2003

Highly Cited

2003

- Christoph Tillmann, Hermann Ney
- Computational Linguistics
- 2003

In this article, we describe an efficient beam search algorithm for statistical machine translation based on dynamic programmingâ€¦Â (More)

Is this relevant?

1998

1998

- Weixiong Zhang
- AAAI/IAAI
- 1998

Beam search executes a search method, such as best-first search or depth-first search, but may abandon nonpromising searchâ€¦Â (More)

Is this relevant?

Highly Cited

1997

Highly Cited

1997

- Christoph Tillmann, Stephan Vogel, Hermann Ney, A. Zubiaga, Hassan Sawaf
- EUROSPEECH
- 1997

In this paper, we describe a fast search algorithm for statistical translation based on dynamic programming (DP) and presentâ€¦Â (More)

Is this relevant?

Highly Cited

1997

Highly Cited

1997

- Stefan Ortmanns, Andreas Eiden, Hermann Ney, Norbert Coenen
- ICASSP
- 1997

In this paper, we present two efficient look-ahead pruning techniques in beam search for large vocabulary continuous speechâ€¦Â (More)

Is this relevant?