EcoSearch is a best-first bottom-up search algorithm that, assuming integer costs, has constant delay between output programs, and it outperforms Heap Search and Bee Search in two classic synthesis domains.
Before returning p′, we need to update the data structures, lines 12 to 16
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
EcoSearch: A Constant-Delay Best-First Search Algorithm for Program Synthesis
EcoSearch is a best-first bottom-up search algorithm that, assuming integer costs, has constant delay between output programs, and it outperforms Heap Search and Bee Search in two classic synthesis domains.