By Letter: Non-alphabet | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z
  Email this page to a friend

Beam search

An optimisation of the best first search graph search algorithm where only a predetermined number of paths are kept as candidates.

The number of paths is the "width of the beam".

If more paths than this are generated, the worst paths are discarded.

This reduces the space requirements of best first search.

< Previous Terms Terms Containing beam search Next Terms >
best first search
beanie key
bearer channel
bear paw
Beats the shit outa me

Web Standards & Support:

Link to and support Powered by LoadedWeb Web Hosting
Valid XHTML 1.0!Valid CSS! FireFox Extensions