FAQ

Beam search

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)
Wikipedia

Topic mentions per year

Topic mentions per year

1982-2018
020406019822018

Related topics

Related topics

15 relations
Anytime algorithmArtificial intelligenceBeam stack searchBest-first search
(More)

Related mentions per year

Related mentions per year

1936-2018
19401960198020002020
Beam search
Heuristic
Computer science
Artificial intelligence
Speech recognition
Search algorithm

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Monte Carlo Beam Search
Monte Carlo tree search is the state of the art for multiple games and for solving puzzles such as Morpion Solitaire. Nested… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
Highly Cited
2011
Highly Cited
2011
Syntactic Processing Using the Generalized Perceptron and Beam Search
We study a range of syntactic processing tasks using a general statistical framework that consists of a global linear model… (More)
  • table 1
  • table 3
  • figure 3
  • table 4
  • table 5
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Limited Discrepancy Beam Search
Beam search reduces the memory consumption of bestfirst search at the cost of finding longer paths but its memory consumption can… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 4
  • figure 3
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Beam-Stack Search: Integrating Backtracking with Beam Search
We describe a method for transforming beam search into a complete search algorithm that is guaranteed to find an optimal solution… (More)
  • table 1
  • table 2
  • table 3
  • figure 2
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Beam-ACO - hybridizing ant colony optimization with beam search: an application to open shop scheduling
Ant colony optimization (ACO) is a metaheuristic approach to tackle hard combinatorial optimization problems. The basic component… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • table 2
Is this relevant?
2004
2004
Recovering Beam Search: Enhancing the Beam Search Approach for Combinatorial Optimization Problems
A hybrid heuristic method for combinatorial optimization problems is proposed that combines di erent classical techniques such as… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Word Reordering and a Dynamic Programming Beam Search Algorithm for Statistical Machine Translation
In this article, we describe an efficient beam search algorithm for statistical machine translation based on dynamic programming… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1998
1998
Complete Anytime Beam Search
Beam search executes a search method, such as best-first search or depth-first search, but may abandon nonpromising search… (More)
  • table 2
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Accelerated DP based search for statistical translation
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
Look-ahead techniques for fast beam search
In this paper, we present two efficient look-ahead pruning techniques in beam search for large vocabulary continuous speech… (More)
  • table 1
Is this relevant?