ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2204.12043
  4. Cited By
An Efficient Dynamic Sampling Policy For Monte Carlo Tree Search

An Efficient Dynamic Sampling Policy For Monte Carlo Tree Search

26 April 2022
Gongbo Zhang
Yijie Peng
Yilong Xu
ArXiv (abs)PDFHTML

Papers citing "An Efficient Dynamic Sampling Policy For Monte Carlo Tree Search"

3 / 3 papers shown
Title
Streaming Looking Ahead with Token-level Self-reward
Han Zhang
Ruixin Hong
Dong Yu
76
2
0
24 Feb 2025
Top-Two Thompson Sampling for Contextual Top-mc Selection Problems
Top-Two Thompson Sampling for Contextual Top-mc Selection Problems
Xinbo Shi
Yijie Peng
Gongbo Zhang
59
1
0
30 Jun 2023
Exploring search space trees using an adapted version of Monte Carlo
  tree search for combinatorial optimization problems
Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems
Jorik Jooken
Pieter Leyman
T. Wauters
P. D. Causmaecker
70
17
0
22 Oct 2020
1