File Download

There are no files associated with this item.

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

Views & Downloads

Detailed Information

Cited time in webofscience Cited time in scopus
Metadata Downloads

Full metadata record

DC Field Value Language
dc.citation.conferencePlace US -
dc.citation.title AAAI Conference on Artificial Intelligence -
dc.contributor.author Kim, Beomjoon -
dc.contributor.author Lee, Kyungjae -
dc.contributor.author Lim, Sungbin -
dc.contributor.author Kaelbling, Leslie -
dc.contributor.author Lozano-Perez, Tomas -
dc.date.accessioned 2024-01-31T23:08:04Z -
dc.date.available 2024-01-31T23:08:04Z -
dc.date.created 2020-01-20 -
dc.date.issued 2020-02-07 -
dc.identifier.bibliographicCitation AAAI Conference on Artificial Intelligence -
dc.identifier.uri https://scholarworks.unist.ac.kr/handle/201301/78615 -
dc.publisher AAAI -
dc.title Monte Carlo Tree Search in continuous spaces using Voronoi optimistic optimization with regret bounds -
dc.type Conference Paper -
dc.date.conferenceDate 2020-02-07 -

qrcode

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