연구
Equal-Budget Monte Carlo Tree Search versus Randomized-Restart List Scheduling for DAG Workflows: A Controlled Equal-Budget Computational Study
arXiv:2610.12542v1 Announce Type: new Abstract: Monte Carlo Tree Search MCTS is often proposed for scheduling directedacyclicgraph DAG workflows, yet most studies never run the comparison that could refute it giving a much simpler method the same search effort.
이 콘텐츠는 ArXiv AI 원본 기사의 요약입니다. 전문은 원본 사이트에서 확인해주세요.
원문 기사 보기 →