Research map / Learning theory and algorithms / Combinatorial and search optimization
Breadth-First Search vs. Restarting Random Walks for Escaping Uninformed Heuristic Regions
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
- On the Completeness of Best-First Search Variants That Use Random Exploration (AAAI 2016 · similarity 0.88)
- An Improved Generic Bet-and-Run Strategy with Performance Prediction for Stochastic Local Search (AAAI 2019 · similarity 0.86)
- Tiebreaking Strategies for A* Search: How to Explore the Final Frontier (AAAI 2016 · similarity 0.86)
- How the Duration of the Learning Period Affects the Performance of Random Gradient Selection Hyper-Heuristics (AAAI 2020 · similarity 0.86)
- From Exact to Anytime Solutions for Marginal MAP (AAAI 2016 · similarity 0.86)
- Parallel Greedy Best-First Search with a Bound on Expansions Relative to Sequential Search (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.