Scholarworks@UNIST

UNIST Library
Search

File Download

There are no files associated with this item.

SFX Link

  • Find it @ UNIST can give you direct access to the published full text of this article. (UNISTARs only)

Views & Downloads

Detailed Information

Previous
Cited time in webofscience Cited time in scopus
Metadata Downloads

Monte Carlo Tree Search in continuous spaces using Voronoi optimistic optimization with regret bounds

Author(s)
Kim, Beomjoon, Lee, Kyungjae, Lim, Sungbin, Kaelbling, Leslie, Lozano-Perez, Tomas
Issued Date
2020-02-07
URI
https://scholarworks.unist.ac.kr/handle/201301/78615
Citation
AAAI Conference on Artificial Intelligence
Publisher
AAAI

Show Full Item Record

qrcode

Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.

STATISTICS
Total View :287,788
Total Download :12,685
Today View :141

RSS 1.0 RSS 2.0

CONTACT US

UNIST | Library

Tel : 052-217-1404 / Email : scholarworks@unist.ac.kr

Copyright (c) 2023 by UNIST LIBRARY. All rights reserved.

ScholarWorks@UNIST was established as an OAK Project for the National Library of Korea.