Equal-budget Monte Carlo Tree Search versus randomized-restart list scheduling for DAG workflows: a controlled equal-budget computational study
Read the original at arxiv.org→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...
Original headline: "Equal-Budget Monte Carlo Tree Search versus Randomized-Restart List Scheduling for DAG Workflows: A Controlled Equal-Budget Computational Study"
Coverage timeline
- Oct 12, 04:00 UTC arXiv cs.AI lead source Equal-Budget Monte Carlo Tree Search versus Randomized-Restart List Scheduling for DAG Workflows: A Controlled Equal-Budget Computational Study