A solution to the GHI problem for best-first search (Q1589511)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A solution to the GHI problem for best-first search |
scientific article; zbMATH DE number 1542312
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A solution to the GHI problem for best-first search |
scientific article; zbMATH DE number 1542312 |
Statements
A solution to the GHI problem for best-first search (English)
0 references
12 December 2000
0 references
graph-history interaction problem
0 references
best-first search
0 references
base-twin algorithm
0 references
0.8502921
0 references
0.8467467
0 references
0.8401522
0 references
0.83972925
0 references
0.83536035
0 references
0.8295398
0 references
0.82817805
0 references
