Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

On the asymptotic performance of IDA

From MaRDI portal
Publication:1370597
Jump to:navigation, search

DOI10.1023/A:1018980327559zbMath0887.68018MaRDI QIDQ1370597

J. Ning

Publication date: 26 October 1997

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)


zbMATH Keywords

best-first search algorithms


Mathematics Subject Classification ID

Searching and sorting (68P10)


Related Items (5)

Agent searching in a tree and the optimality of iterative deepening ⋮ Inconsistent heuristics in theory and practice ⋮ Improving the efficiency of depth-first search by cycle elimination ⋮ Performance of linear-space search algorithms ⋮ Parallel multithreaded IDA* heuristic search: algorithm design and performance evaluation




This page was built for publication: On the asymptotic performance of IDA

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1370597&oldid=13517903"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 15:07.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki