Research map / Learning theory and algorithms / Combinatorial and search optimization
PEA*+IDA*: An Improved Hybrid Memory-Restricted Algorithm
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.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Replace A* with PEA* in the first phase | A*+IDA* hybrid · IPC STRIPS tasks, 10% memory limit | coverage: 247 -> 249 | Helped |
| Replace A* with PEA* in the first phase | A*+IDA* hybrid · IPC STRIPS tasks, 50% memory limit | coverage: 267 -> 306 | Helped |
| Replace A* with PEA* in the first phase | A*+IDA* hybrid · IPC STRIPS tasks, 90% memory limit | coverage: 275 -> 318 | Helped |
| Replace A* with PEA* in the first phase | A*+IDA* hybrid · IPC STRIPS tasks, 10% memory limit | expansions: 149,628.33 -> 132,823.20 | Helped |
| Replace A* with PEA* in the first phase | A*+IDA* hybrid · IPC STRIPS tasks, 50% memory limit | expansions: 40,284.94 -> 7,815.38 | Helped |
| Replace A* with PEA* in the first phase | A*+IDA* hybrid · IPC STRIPS tasks, 90% memory limit | expansions: 23,554.71 -> 7,133.72 | Helped |
| Raise A*+IDA* Open nodes' F-values to F↑ before the IDA* phase (ablation) | A*+IDA* · IPC STRIPS tasks, 10% memory limit | IDA* phase expansions: 145,201.08 -> 73,442.10 | Helped |
| Raise A*+IDA* Open nodes' F-values to F↑ before the IDA* phase (ablation) | A*+IDA* · IPC STRIPS tasks, 50% memory limit | IDA* phase expansions: 30,306.27 -> 220.13 | Helped |
| Raise A*+IDA* Open nodes' F-values to F↑ before the IDA* phase (ablation) | A*+IDA* · IPC STRIPS tasks, 90% memory limit | IDA* phase expansions: 8,093.42 -> 60.60 | Helped |
| Use PEA*'s Open composition rather than A*'s composition (ablation) | Hybrid memory-restricted search · IPC STRIPS tasks, 10% memory limit | IDA* phase expansions: A*+IDA*↑ has 73,442.10; PEA*+IDA* has 35,506.81 | Helped |
| Use PEA*'s Open composition rather than A*'s composition (ablation) | Hybrid memory-restricted search · IPC STRIPS tasks, 50% memory limit | IDA* phase expansions: A*+IDA*↑ has 220.13; PEA*+IDA* has 3.29 | Helped |
| Use PEA*'s Open composition rather than A*'s composition (ablation) | Hybrid memory-restricted search · IPC STRIPS tasks, 90% memory limit | IDA* phase expansions: A*+IDA*↑ has 60.60; PEA*+IDA* has 0.47 | Helped |
Closest papers by meaning
- A*+BFHS: A Hybrid Heuristic Search Algorithm (AAAI 2022 · similarity 0.87)
- Parallel Greedy Best-First Search with a Bound on Expansions Relative to Sequential Search (AAAI 2025 · similarity 0.86)
- ImpatientCapsAndRuns: Approximately Optimal Algorithm Configuration from an Infinite Pool (NeurIPS 2020 · similarity 0.85)
- Limited Memory Kelley's Method Converges for Composite Convex and Submodular Objectives (NeurIPS 2018 · similarity 0.84)
- Eco Search: A No-delay Best-First Search Algorithm for Program Synthesis (AAAI 2025 · similarity 0.84)
- Freya PAGE: First Optimal Time Complexity for Large-Scale Nonconvex Finite-Sum Optimization with Heterogeneous Asynchronous Computations (NeurIPS 2024 · similarity 0.83)
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.