best-first search
best-first search A search of a directed graph or tree in which a set of “best yet” nodes are maintained. As nodes are visited an evaluation function is used to estimate their value (in terms of a problem solution), and the search proceeds by exploring the node with the best value from the set of best yet nodes. The A* algorithm is an example method.
More From encyclopedia.com
Search , search / sərch/ • v. [intr.] try to find something by looking or otherwise seeking carefully and thoroughly: I searched among the rocks, but there wa… Searching , searching Locating information in a table or file by reference to a special field of each record, called the key. The goal of the search is to discov… Online Information Services , A search engine is an information retrieval system that allows someone to search the vast collection of resources on the Internet and the World Wide… Language, Linguistics, and Literary Terms , best / best/ superlative of good. • adj. of the most excellent, effective, or desirable type or quality: the best pitcher in the league. ∎ most enjoy… Search Engine , search engine A program that when initiated by a search command from a user interface examines a body of data for items satisfying the search criteri… Rummage , rum·mage / ˈrəmij/ • v. [intr.] search unsystematically and untidily through a mass or receptacle: he rummaged in his pocket for a handkerchief | [tr…
You Might Also Like
NEARBY TERMS
best-first search