Beam stack search is a search algorithm that combines chronological backtracking (that is, depth-first search) with beam search and is similar to depth-first beam search. Both search algorithms are anytime algorithms that find good but likely sub-optimal solutions quickly, like beam search, then backtrack and continue to find improved solutions until convergence to an optimal solution.
Attributes | Values |
---|---|
rdf:type | |
rdfs:label |
|
rdfs:comment |
|
sameAs | |
dbp:wikiPageUsesTemplate | |
Subject | |
gold:hypernym | |
prov:wasDerivedFrom | |
Wikipage page ID |
|
page length (characters) of wiki page |
|
Wikipage revision ID |
|
Link from a Wikipage to another Wikipage | |
has abstract |
|
foaf:isPrimaryTopicOf | |
is Wikipage redirect of | |
is Link from a Wikipage to another Wikipage of | |
is foaf:primaryTopic of |