Jisho

×
最良優先探索
Links
Wikipedia definition
1. Best-first search​Best-first search is a search algorithm which explores a graph by expanding the most promising node chosen according to a specified rule. Judea Pearl described best-first search as estimating the promise of node n by a "heuristic evaluation function which, in general, may depend on the description of n, the description of the goal, the information gathered by the search up to that point, and most important, on any extra knowledge about the problem domain.
Read “Best-first search” on English Wikipedia
Read “最良優先探索” on Japanese Wikipedia
Read “Best-first search” on DBpedia

Discussions

to talk about this word.