scientific article

zbMath0707.68077MaRDI QIDQ3489496

Anup K. Sen, Amitava Bagchi

Publication date: 1989

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

heuristic searchAND/OR graphs with loopsiterative deepening \(A^ *\)recursive search algorithms

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (11)

Improving search efficiency using possible subgoals ⋮ Linear-space best-first search ⋮ A faster alternative to \(SSS^*\) with extension to variable memory ⋮ Improving the efficiency of depth-first search by cycle elimination ⋮ Planning as heuristic search ⋮ Planning and control in artificial intelligence: A unifying perspective ⋮ Finding optimal solutions to the graph partitioning problem with heuristic search ⋮ Heuristic search strategies for multiobjective state space search ⋮ Performance of linear-space search algorithms ⋮ Performance of linear-space search algorithms ⋮ \(\text{BIDA}^*\): An improved perimeter search algorithm

This page was built for publication: