# Equal-Budget Monte Carlo Tree Search versus Randomized-Restart List Scheduling for DAG Workflows: A Controlled Equal-Budget Computational Study

> 全文为英语

**Published:** 2026年10月12日
**Author:** Yuyu Zhang
**Source:** arXiv — cs.AI
**Language:** en-US
**HTML:** https://aiqazaqstan.com/zh/articles/equal-budget-monte-carlo-tree-search-versus-randomized-restart-list-sche

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 could refute it - giving a much simpler method the same search effort. We run…

> 内容来自原始来源： **arXiv — cs.AI**
> [在 arXiv — cs.AI 阅读全文](https://arxiv.org/abs/2610.12542)

**标签：** #arXiv

---

*AI Qazaqstan — non-commercial informational portal about AI in Kazakhstan. Machine translations and summaries are AI-generated.*