Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/B*> ?p ?o }
Showing triples 1 to 50 of
50
with 100 triples per page.
- B* abstract "In computer science, B* (pronounced "B star") is a best-first graph search algorithm that finds the least-cost path from a given initial node to any goal node (out of one or more possible goals). First published by Hans Berliner in 1979, it is related to the A* search algorithm.".
- B* wikiPageID "14993828".
- B* wikiPageLength "6754".
- B* wikiPageOutDegree "21".
- B* wikiPageRevisionID "666302665".
- B* wikiPageWikiLink A*_search_algorithm.
- B* wikiPageWikiLink Alpha-beta_pruning.
- B* wikiPageWikiLink Alpha–beta_pruning.
- B* wikiPageWikiLink Artificial_Intelligence:_A_Modern_Approach.
- B* wikiPageWikiLink Artificial_Intelligence_(journal).
- B* wikiPageWikiLink B-Tree.
- B* wikiPageWikiLink B-tree.
- B* wikiPageWikiLink Best-first_search.
- B* wikiPageWikiLink Branch_and_bound.
- B* wikiPageWikiLink Category:Combinatorial_optimization.
- B* wikiPageWikiLink Category:Game_artificial_intelligence.
- B* wikiPageWikiLink Category:Graph_algorithms.
- B* wikiPageWikiLink Category:Routing_algorithms.
- B* wikiPageWikiLink Category:Search_algorithms.
- B* wikiPageWikiLink Computer_science.
- B* wikiPageWikiLink Goal_node.
- B* wikiPageWikiLink Goal_node_(computer_science).
- B* wikiPageWikiLink Graph_search_algorithm.
- B* wikiPageWikiLink Graph_traversal.
- B* wikiPageWikiLink Hans_Berliner.
- B* wikiPageWikiLink Maven_(Scrabble).
- B* wikiPageWikiLink Node_(graph_theory).
- B* wikiPageWikiLink Tree_(graph_theory).
- B* wikiPageWikiLink Vertex_(graph_theory).
- B* wikiPageWikiLinkText "B*".
- B* hasPhotoCollection B*.
- B* wikiPageUsesTemplate Template:About.
- B* wikiPageUsesTemplate Template:Cite_book.
- B* wikiPageUsesTemplate Template:Cite_journal.
- B* wikiPageUsesTemplate Template:Graph_search_algorithm.
- B* subject Category:Combinatorial_optimization.
- B* subject Category:Game_artificial_intelligence.
- B* subject Category:Graph_algorithms.
- B* subject Category:Routing_algorithms.
- B* subject Category:Search_algorithms.
- B* hypernym Algorithm.
- B* type Software.
- B* comment "In computer science, B* (pronounced "B star") is a best-first graph search algorithm that finds the least-cost path from a given initial node to any goal node (out of one or more possible goals). First published by Hans Berliner in 1979, it is related to the A* search algorithm.".
- B* label "B*".
- B* sameAs m.03h42hk.
- B* sameAs B*.
- B* sameAs Q4833637.
- B* sameAs Q4833637.
- B* wasDerivedFrom B*?oldid=666302665.
- B* isPrimaryTopicOf B*.