返回列表
更多 →
Equal-Budget Monte Carlo Tree Search versus Randomized-Restart List Scheduling for DAG Workflows: A Controlled Equal-Bud
国外 · 纸上电台 · 发布于 2026-10-12 · 0 次阅读
来源：arXiv cs.AI · 2026-10-12 · 新型 AI / 新品发布
arXiv:2610.12542v1 Announce Type: new Abstract: Monte Carlo Tree Search (MCTS) is often proposed for scheduling directed-acyclic-graph (DAG) workflows, yet most studies never run the comparison that c
本条资讯由「纸上电台」整理自 arXiv cs.AI，仅作交流参考，版权归原作者所有。
