logo

Video encyclopedia

Beam search

1:47

Beam Search

2:08

Beam Search algorithm

3:26

3 BEAM SEARCH BUSQUEDA HAZ

3:06

Unit1 Local Beam Search

1:07

Local 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 search is an optimization of best-first search that reduces its memory requirements. Best-first search is a graph search which orders all partial solutions (states) according to some heuristic. But in beam search, only a predetermined number of best partial solutions are kept as candidates. It is thus a greedy algorithm.
    Explore contextually related video stories in a new eye-catching way. Try Combster now!
    • DetailsĀ 

    • VariantsĀ