Effective use of memory in iterative deepening search (Q1198022): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Three approaches to heuristic search in networks / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Heuristic search in restricted memory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Increasing search efficiency using multiple heuristics / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Generalized best-first search strategies and the optimality of A* / 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: Q3856120 / 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 14:35, 16 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Effective use of memory in iterative deepening search |
scientific article |
Statements
Effective use of memory in iterative deepening search (English)
0 references
16 January 1993
0 references
\(IDA^*\)
0 references
tree search
0 references
approximation algorithm
0 references
\(A^*\)
0 references
flow-shop scheduling problem
0 references