\(\text{BIDA}^*\): An improved perimeter search algorithm
type: Item
instance of: scholarly article
title: \(\text{BIDA}^*\): An improved perimeter search algorithm
zbMATH Open document ID: 1013.68546
DOI: 10.1016/0004-3702(95)00017-9
author: Giovanni Manzini
published in: Artificial Intelligence
publication date: 2003-02-04T00:00:00Z
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 90B40
zbMATH DE Number: 1863783
MaRDI profile type: Publication
full work available at URL: 0004-3702(95)00017-9
OpenAlex ID: W1975532906
cites work: Heuristic search in restricted memory
cites work: Bidirectional Heuristic Search Again
cites work: An Improved Bidirectional Heuristic Search Algorithm
cites work: Bidirectional heuristic search with limited resources
cites work: Depth-first iterative-deepening: An optimal admissible tree search
cites work: Linear-space best-first search
cites work: Q5626306
cites work: Reducing reexpansions in iterative-deepening search by controlling cutoff bounds
cites work: Effective use of memory in iterative deepening search
cites work: Q3489496
cites work: Group graphs and computational symmetry on massively parallel architecture
description: scientific article; zbMATH DE number 1863783