The time complexity of \(A^*\) with approximate heuristics on multiple-solution search spaces (Q4899134)
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 6122393
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The time complexity of \(A^*\) with approximate heuristics on multiple-solution search spaces |
scientific article; zbMATH DE number 6122393 |
Statements
The Time Complexity of A* with Approximate Heuristics on Multiple-Solution Search Spaces (English)
0 references
7 January 2013
0 references
heuristics
0 references
search algorithms
0 references
time complexity of \(A^*\) search on trees
0 references
upper bounds
0 references
knapsack problem
0 references
partial Latin square problem
0 references
0.818738579750061
0 references
0.7976908087730408
0 references
0.791160523891449
0 references
0.788349449634552
0 references
