Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Beam_search> ?p ?o. }
Showing items 1 to 26 of
26
with 100 items per page.
- Beam_search abstract "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 which attempts to predict how close a partial solution is to a complete solution (goal state). But in beam search, only a predetermined number of best partial solutions are kept as candidates.Beam search uses breadth-first search to build its search tree. At each level of the tree, it generates all successors of the states at the current level, sorting them in increasing order of heuristic cost. However, it only stores a predetermined number of best states at each level (called the beam width). Only those states are expanded next. The greater the beam width, the fewer states are pruned. With an infinite beam width, no states are pruned and beam search is identical to breadth-first search. The beam width bounds the memory required to perform the search. Since a goal state could potentially be pruned, beam search sacrifices completeness (the guarantee that an algorithm will terminate with a solution, if one exists). By the nature of best-first search and since beam search is a special case of best-first search, it is not optimal (the guarantee that it will find the best solution). It returns the first solution found.The beam width can either be fixed or variable. One approach that uses a variable beam width starts with the width at a minimum. If no solution is found, the beam is widened and the procedure is repeated.".
- Beam_search wikiPageID "1686032".
- Beam_search wikiPageRevisionID "585871468".
- Beam_search hasPhotoCollection Beam_search.
- Beam_search subject Category:Search_algorithms.
- Beam_search type Abstraction100002137.
- Beam_search type Act100030358.
- Beam_search type Activity100407535.
- Beam_search type Algorithm105847438.
- Beam_search type Event100029378.
- Beam_search type Procedure101023820.
- Beam_search type PsychologicalFeature100023100.
- Beam_search type Rule105846932.
- Beam_search type SearchAlgorithms.
- Beam_search type YagoPermanentlyLocatedEntity.
- Beam_search comment "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 which attempts to predict how close a partial solution is to a complete solution (goal state).".
- Beam_search label "Algorithme de recherche en faisceau".
- Beam_search label "Beam search".
- Beam_search sameAs Paprskové_prohledávání.
- Beam_search sameAs Algorithme_de_recherche_en_faisceau.
- Beam_search sameAs m.05n9z3.
- Beam_search sameAs Q2835852.
- Beam_search sameAs Q2835852.
- Beam_search sameAs Beam_search.
- Beam_search wasDerivedFrom Beam_search?oldid=585871468.
- Beam_search isPrimaryTopicOf Beam_search.