Probably bounded suboptimal heuristic search

DOI10.1016/j.artint.2018.08.005zbMath1478.68337OpenAlexW2898297778WikidataQ129031843 ScholiaQ129031843MaRDI QIDQ2321255

Roni Stern, Gal Dreiman, Richard Valenzano

Publication date: 28 August 2019

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2018.08.005

zbMATH Keywords

artificial intelligenceheuristic search

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

SCCWalk: an efficient local search algorithm and its improvements for maximum weight clique problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Predicting the size of IDA\(^*\)'s search tree
• Learning heuristic functions for large state spaces
• Inconsistent heuristics in theory and practice
• Linear-space best-first search
• Depth-first iterative-deepening: An optimal admissible tree search
• Potential-based bounded-cost search and anytime non-parametric A*
• Heuristic search viewed as path finding in a graph
• Probably approximately optimal satisficing strategies
• A theory of the learnable
• Probabilistic checking of proofs
• Studies in Semi-Admissible Heuristics
• Predicting the Performance of IDA* using Conditional Distributions
• Time complexity of iterative-deepening-\(A^{*}\)
• Disjoint pattern database heuristics

This page was built for publication: Probably bounded suboptimal heuristic search