Effective use of memory in iterative deepening search (Q1198022)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 92091
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Effective use of memory in iterative deepening search |
scientific article; zbMATH DE number 92091 |
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
0 references
0.8229511
0 references
0 references
0 references
0.81604743
0 references
