Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Beam_search> ?p ?o }
Showing triples 1 to 41 of
41
with 100 triples 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). Beam search is not optimal (that is, there is no 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 wikiPageLength "4332".
- Beam_search wikiPageOutDegree "15".
- Beam_search wikiPageRevisionID "671321457".
- Beam_search wikiPageWikiLink Anytime_algorithm.
- Beam_search wikiPageWikiLink Beam_stack_search.
- Beam_search wikiPageWikiLink Best-first_search.
- Beam_search wikiPageWikiLink Breadth-first_search.
- Beam_search wikiPageWikiLink Carnegie_Mellon_University.
- Beam_search wikiPageWikiLink Category:Search_algorithms.
- Beam_search wikiPageWikiLink Completeness_(logic).
- Beam_search wikiPageWikiLink Computer_science.
- Beam_search wikiPageWikiLink Depth-first_search.
- Beam_search wikiPageWikiLink Heuristic_(computer_science).
- Beam_search wikiPageWikiLink Machine_translation.
- Beam_search wikiPageWikiLink Raj_Reddy.
- Beam_search wikiPageWikiLink Search_algorithm.
- Beam_search wikiPageWikiLink Tree_traversal.
- Beam_search wikiPageWikiLinkText "Beam search".
- Beam_search wikiPageWikiLinkText "beam search".
- Beam_search wikiPageUsesTemplate Template:Reflist.
- Beam_search wikiPageUsesTemplate Template:Tree_search_algorithm.
- Beam_search subject Category:Search_algorithms.
- Beam_search hypernym Algorithm.
- Beam_search type Software.
- Beam_search type Algorithm.
- 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 "Beam search".
- Beam_search sameAs Q2835852.
- Beam_search sameAs Paprskové_prohledávání.
- Beam_search sameAs الگوریتم_جستجوی_پرتو_محلی.
- Beam_search sameAs Algorithme_de_recherche_en_faisceau.
- Beam_search sameAs Փնտրման_ճառագայթ.
- Beam_search sameAs m.05n9z3.
- Beam_search sameAs Претрага_бима.
- Beam_search sameAs การค้นหาแบบบีม.
- Beam_search sameAs Променевий_пошук.
- Beam_search sameAs Q2835852.
- Beam_search wasDerivedFrom Beam_search?oldid=671321457.
- Beam_search isPrimaryTopicOf Beam_search.