Tag
This paper formalizes the analysis of tie-breaking strategies in A* search, demonstrating that standard strategies are pairwise incomparable in expansion counts and providing insights into heuristic weighting effects.
This paper presents a systematic characterization of a multiprobe grid algorithm for approximate nearest neighbor search, revealing scaling crossovers and competitive performance in high-dimensional settings.