KBFS: K-Best-First Search

DOI10.1023/A:1024452529781zbMath1045.68046OpenAlexW1542787556MaRDI QIDQ1397235

Ariel Felner, Sarit Kraus, Richard E. Korf

Publication date: 27 July 2003

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

Full work available at URL: https://doi.org/10.1023/a:1024452529781

Mathematics Subject Classification ID

Searching and sorting (68P10)

Related Items (6)

Weighted \(A^*\) search - unifying view and application ⋮ Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects ⋮ Extended beam search for non-exhaustive state space analysis ⋮ Joint search with self-interested agents and the failure of cooperation enhancers ⋮ Widening: using parallel resources to improve model quality ⋮ Node selection strategies in interval branch and bound algorithms

This page was built for publication: KBFS: K-Best-First Search