Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
UCT
Description:
An acronym commonly used for the Upper Confidence bounds applied to Trees algorithm, a Monte Carlo tree-search method for decision-making.
Primary topic:
Artificial Intelligence in Games (48%)
Related topics:
Artificial Intelligence in Games (48%),
Advanced Operator Algebra Research (18%)
OpenAlex ID:
keywords/uct
Combining online and offline knowledge in UCT
2007
·
Sylvain Gelly
, David Silver
·
International Conference on Machine Learning
·
589
Modification of UCT with Patterns in Monte-Carlo Go
2006
·
Sylvain Gelly
, Yizao Wang
, et al.
·
HAL
·
372
Quasidiagonality of nuclear C^*-algebras
2016
·
Aaron Tikuisis
, Stuart White
, et al.
·
Annals of Mathematics
·
354
PDF
From Bandits to Monte-Carlo Tree Search: The Optimistic Principle Applied to Optimization and Planning
2014
·
Rémi Munos
·
Foundations and Trends® in Machine Learning
·
327
The nuclear dimension of C ∗ -algebras
2009
·
Wilhelm Winter
, Joachim Zacharias
·
Advances in Mathematics
·
313
PDF
A simple C*-algebra with a finite and an infinite projection
2003
·
Mikael Rørdam
·
Acta Mathematica
·
203
PDF
Exploration exploitation in Go: UCT for Monte-Carlo Go
2006
·
Gelly, Sylvain
, Wang, Yizao
·
HAL
·
195
On the classification of simple amenable $C*$-algebras with finite decomposition rank, II
2015
·
Elliott, George A.
, Gong, Guihua
, et al.
·
arXiv (Cornell University)
·
190
PDF
UCT for tactical assault planning in real-time strategy games
2009
·
Radha-Krishna Balla
, Alan Fern
·
International Joint Conference on Artificial Intelligence
·
186
Bandit Algorithms for Tree Search
2014
·
Coquelin, Pierre-Arnuad
, Munos, Remi
·
arXiv (Cornell University)
·
165
PDF
Sample-based learning and search with permanent and transient memories
2008
·
David Silver
, Richard S. Sutton
, et al.
·
International Conference on Machine Learning
·
143
Modifications of UCT and sequence-like simulations for Monte-Carlo Go
2007
·
Yizao Wang
, Sylvain Gelly
·
IEEE Conference on Computational Intelligence and Games (CIG)
·
142
Achieving master level play in 9×9 computer go
2008
·
Sylvain Gelly
, David Silver
·
UCL Discovery (University College London)
·
137
Localizing the Elliott conjecture at strongly self-absorbing C* -algebras
2012
·
Wilhelm Winter
·
Journal für die reine und angewandte Mathematik (Crelles Journal)
·
130
PDF
On the classification of simple amenable C*-algebras with finite decomposition rank
2016
·
George Elliott
, Zhuang Niu
·
Contemporary mathematics - American Mathematical Society
·
124
PDF
On the Parallelization of UCT
2007
·
Tristan Cazenave
, Nicolas Jouandeau
·
HAL
·
123
Classification of finite simple amenable ${\cal Z}$-stable $C^*$-algebras
2014
·
Gong, Guihua
, Lin, Huaxin
, et al.
·
arXiv (Cornell University)
·
121
PDF
Feature Selection as a One-Player Game
2010
·
Romaric Gaudel
, Michèle Sébag
·
HAL
·
121
Amazons Discover Monte-Carlo
2008
·
Richard J. Lorentz
·
Lecture notes in computer science
·
117
Trial-Based Heuristic Tree Search for Finite Horizon MDPs
2013
·
Thomas Keller
, Malte Helmert
·
Proceedings of the International Conference on Automated Planning and Scheduling
·
112
PDF
Monte-Carlo Tree Search as Regularized Policy Optimization
2020
·
Grill, Jean-Bastien
, Altché, Florent
, et al.
·
arXiv (Cornell University)
·
103
PDF
Every classifiable simple C*-algebra has a Cartan subalgebra
2019
·
Xin Li
·
Inventiones mathematicae
·
99
PDF
Combining UCT and Nested Monte Carlo Search for Single-Player General Game Playing
2010
·
Jean Mehat
, Tristan Cazenave
·
IEEE Transactions on Computational Intelligence and AI in Games
·
99
Lower Bounding Klondike Solitaire with Monte-Carlo Planning
2009
·
Ronald Bjarnason
, Alan Fern
, et al.
·
Proceedings of the International Conference on Automated Planning and Scheduling
·
95
PDF
Purely infinite C*-algebras arising from crossed products
2011
·
MIKAEL RØRDAM
, ADAM SIERAKOWSKI
·
Ergodic Theory and Dynamical Systems
·
91
Show more works
View as search
Works count:
494
Citation count:
9,211
Year
Topic
Type