We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Anytime heuristic search algorithms try to find a (potentially suboptimal) solution as quickly as possible and then work to find better and better solutions until an optimal solution is obtained or time is exhausted. The most widely-known anytime search algorithms are based on best-first search. In this paper, we propose a new algorithm, rectangle search, that is instead based on beam search, a variant of breadth-first search. It repeatedly explores alternatives at all depth levels and is thus best-suited to problems featuring deep local minima. Experiments using a variety of popular search benchmarks suggest that rectangle search is competitive with fixed-width beam search and often performs better than the previous best anytime search algorithms.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2312.12554")
get_code_for_paper("2312.12554")
have("2312.12554")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2312.12554.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2312.12554)
Connect an agent — have() is free.