Agent searching in a tree and the optimality of iterative deepening (Q1341670): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Searching in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel searching in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic search in restricted memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4012191 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-first iterative-deepening: An optimal admissible tree search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Real-time heuristic search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-space best-first search / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the asymptotic performance of IDA / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest paths without a map / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducing reexpansions in iterative-deepening search by controlling cutoff bounds / rank
 
Normal rank

Latest revision as of 10:13, 23 May 2024

scientific article
Language Label Description Also known as
English
Agent searching in a tree and the optimality of iterative deepening
scientific article

    Statements

    Identifiers