Research map / Learning theory and algorithms / Combinatorial and search optimization
On the Completeness of Best-First Search Variants That Use Random Exploration
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Best-First Width Search: Exploration and Exploitation in Classical Planning (AAAI 2017 · similarity 0.89)
- Breadth-First Search vs. Restarting Random Walks for Escaping Uninformed Heuristic Regions (AAAI 2026 · similarity 0.88)
- Tiebreaking Strategies for A* Search: How to Explore the Final Frontier (AAAI 2016 · similarity 0.87)
- New Results in Bounded-Suboptimal Search (AAAI 2022 · similarity 0.87)
- SeeA*: Efficient Exploration-Enhanced A* Search by Selective Sampling (NeurIPS 2024 · similarity 0.86)
- Eco Search: A No-delay Best-First Search Algorithm for Program Synthesis (AAAI 2025 · similarity 0.85)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.