A Memory-Bounded Best-First Beam Search and Its Application to Scheduling Halide Programs

Published in The Fifteenth International Symposium on Combinatorial Search 2022, 2022

Recommended citation: Chao Gao et al., A Memory-Bounded Best-First Beam Search and Its Application to Scheduling Halide Programs http://search-conference.org/`

This paper revisits beam search from the perspective of memory-bounded search and proposes a strategy for improving its effectiveness. We demonstrate the usefuless of this new algorithm in Halide scheduling.

Download paper

Repository