skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Title: Partitioning and Gaussian Processes for Accelerating Sampling in Monte Carlo Tree Search for Continuous Decisions
Award ID(s):
2046588
PAR ID:
10432507
Author(s) / Creator(s):
; ;
Date Published:
Journal Name:
2021 Winter Simulation Conference (WSC)
Page Range / eLocation ID:
1 to 13
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. null (Ed.)
    This presentation poster summarizes the recruitment efforts, insights gained, and lessons learned through the VolsTeach for Appalachia project that focuses on recruiting and preparing community college students in becoming STEM teachers in East Tennessee. 
    more » « less
  2. null (Ed.)
  3. Beyersdorff, Olaf; Kanté, Mamadou Moustapha; Kupferman, Orna; Lokshtanov, Daniel (Ed.)
    Given a set P of n points and a set S of n segments in the plane, we consider the problem of computing for each segment of S its closest point in P. The previously best algorithm solves the problem in n^{4/3}2^{O(log^*n)} time [Bespamyatnikh, 2003] and a lower bound (under a somewhat restricted model) Ω(n^{4/3}) has also been proved. In this paper, we present an O(n^{4/3}) time algorithm and thus solve the problem optimally (under the restricted model). In addition, we also present data structures for solving the online version of the problem, i.e., given a query segment (or a line as a special case), find its closest point in P. Our new results improve the previous work. 
    more » « less
  4. null (Ed.)