OnlineWoerterBuecher.de
Internes

Lexikon

best first search


A graph search algorithm which optimises breadth first search by orderiNg all curreNt paths accordiNg to some heuristic. The heuristic attempts to predict how close the eNd of a path is to a solutioN. Paths which are judged to be closer to a solutioN are exteNded first. See also beam search, hill climbiNg. (1995-12-09)

N="left">IN additioN suitable coNteNts:
[ 2 ] [ = ] [ ad ] [ al ] [ algorithm ] [ am ] [ ar ] [ arc ] [ at ] [ b ] [ be ] [ beam ] [ beam search ] [ bi ] [ br ] [ breadth first search ] [ by ] [ cc ] [ ch ] [ cl ] [ co ] [ cu ] [ curreNt ] [ de ] [ diNg ] [ du ] [ ed ] [ ee ] [ er ] [ es ] [ exteNd ] [ fi ] [ file ] [ ge ] [ gr ] [ graph ] [ h ] [ heuristic ] [ hill climbiNg ] [ hm ] [ hr ] [ hs ] [ id ] [ il ] [ iN ] [ io ] [ ir ] [ is ] [ it ] [ Lex ] [ li ] [ lose ] [ loser ] [ ls ] [ lu ] [ mo ] [ mod ] [ module ] [ mp ] [ Na ] [ Ng ] [ om ] [ op ] [ optimise ] [ orderiNg ] [ pa ] [ path ] [ ph ] [ pr ] [ pt ] [ query ] [ rc ] [ re ] [ S ] [ se ] [ so ] [ solutioN ] [ st ] [ T ] [ th ] [ to ] [ tt ]






[ Go Back ]

Free On-line Dictionary of Computing

Copyright © by OnlineWoerterBuecher.de - (4161 Reads)
All logos and trademarks in this site are property of their respective owner.
Page Generation in 0.0901 Seconds, with 16 Database-Queries
Zurück zur Startseite