Reproduce “FPTR: Feasibility-Preserving Transactional Refinement for Deadline-Constrained Joint Beam and Resource Allocation” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Minghao Kong, Zirong Liu, Jianhao Wu, Muyao Chen, Jianxin Wu, Rongjie Wang
FPTR separates feasible allocations from optional search in wireless scheduling. It builds each candidate privately and replaces the allocation only when the candidate is complete, validated on time, and strictly improves traffic. Across 150 fixed synthetic instances, Full improved traffic by 1.79% over Base at an 87-ms internal budget, with no losses; this does not establish optimality or hard real-time behavior.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.