Matches in DBpedia 2014 for { <http://dbpedia.org/resource/B*> ?p ?o }
Showing triples 1 to 29 of
29
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* wikiPageRevisionID "601828564".
- B* hasPhotoCollection B*.
- 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* type Abstraction100002137.
- B* type Act100030358.
- B* type Activity100407535.
- B* type Algorithm105847438.
- B* type Event100029378.
- B* type GraphAlgorithms.
- B* type Procedure101023820.
- B* type PsychologicalFeature100023100.
- B* type RoutingAlgorithms.
- B* type Rule105846932.
- B* type SearchAlgorithms.
- B* type YagoPermanentlyLocatedEntity.
- 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 Q4833637.
- B* sameAs Q4833637.
- B* sameAs B*.
- B* wasDerivedFrom B*?oldid=601828564.
- B* isPrimaryTopicOf B*.