Iterative-deepening search with on-line tree size prediction
type: Item
instance of: scholarly article
title: Iterative-deepening search with on-line tree size prediction
zbMATH Open document ID: 1310.68185
author: Ethan Burns
author: Wheeler Ruml
published in: Annals of Mathematics and Artificial Intelligence
publication date: 2014-06-26T00:00:00Z
Mathematics Subject Classification ID: 68T20
zbMATH DE Number: 6308987
zbMATH Keywords: heuristic search
zbMATH Keywords: tree search
zbMATH Keywords: tree size prediction
zbMATH Keywords: reactive search
zbMATH Keywords: autonomous search
describes a project that uses: SATzilla
MaRDI profile type: MaRDI publication profile
full work available at URL: s10472-013-9347-9
OpenAlex ID: W2021545912
cites work: Predicting the Performance of IDA* using Conditional Distributions
cites work: Reactive search and intelligent optimization
cites work: Q4320535
cites work: Depth-first iterative-deepening: An optimal admissible tree search
cites work: Time complexity of iterative-deepening-\(A^{*}\)
cites work: Frontier search
cites work: Reducing reexpansions in iterative-deepening search by controlling cutoff bounds
cites work: Instance-Specific Algorithm Configuration
cites work: A heuristic search algorithm with modifiable estimate
cites work: Q3856120
cites work: Q3624141
DOI: 10.1007/S10472-013-9347-9
description: scientific article; zbMATH DE number 6308987