PPB-MCTS: A novel distributed-memory parallel partial-backpropagation Monte Carlo tree search algorithm

Monte-Carlo Tree Search (MCTS) is an adaptive and heuristic tree-search algorithm designed to uncover sub-optimal actions at each decision-making point. This method progressively constructs a search tree by gathering samples throughout its execution. Predominantly applied within the realm of gaming,...

Celý popis

Podrobná bibliografia

Vydané v:	Journal of parallel and distributed computing Ročník 193; s. 104944
Hlavní autori:	Naderzadeh, Yashar, Grosu, Daniel, Chinnam, Ratna Babu
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Inc 01.11.2024
Predmet:	Job shop scheduling Monte Carlo tree search Parallel algorithms Parallel algorithms Job shop scheduling Monte Carlo tree search
ISSN:	0743-7315
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!