6 papers
Search as Computation Allocation
Alexander Tuisov
Many algorithms spend an internal resource before returning a decision and are evaluated only by the quality of that terminal output. We formalize such procedures as terminal compu…
GONDOR to the Rescue: Satisficing Planning with Low Memory
Yonatan Vernik, Alexander Tuisov, Alexander Shleyfman
Greedy Best-First Search (GBFS) is the dominant approach for solving search problems where the goal can be estimated with a heuristic, such as planning, route finding, navigation,…
Personalized Medication Planning via Direct Domain Modeling and LLM-Generated Heuristics
Yonatan Vernik, Alexander Tuisov, David Izhaki +3
Personalized medication planning involves selecting medications and determining a dosing schedule to achieve medical goals specific to each individual patient. Previous work succes…
Successor-Generator Planning with LLM-generated Heuristics
Alexander Tuisov, Yonatan Vernik, Alexander Shleyfman
Heuristics are a central component of deterministic planning, particularly in domain-independent settings where general applicability is prioritized over task-specific tuning. This…
OSOUM Framework for Trading Data Research
Gregory Goren, Roee Shraga, Alexander Tuisov
In the last decades, data have become a cornerstone component in many business decisions, and copious resources are being poured into production and acquisition of the high-quality…
The Continuous Joint Replenishment Problem is Strongly NP-Hard
Alexander Tuisov, Liron Yedidsion
The Continuous Periodic Joint Replenishment Problem (CPJRP) has been one of the core and most studied problems in supply chain management for the last half a century. Nonetheless,…