AUAI Press / MIT Press / Computer Sciences / Bernstein / AAAI Press / John Wiley & Sons Inc. / John Wiley & Sons / / /
Facility
Stuart Russell Computer Science Division University of California Berkeley / Carnegie-Mellon University / University of California / Computer Science Ben-Gurion University / /
IndustryTerm
tree search / game tree search / search states / tree search algorithms / combinatorial search problems / Classical algorithms / search rollouts / search tree depth / search budget / above approximate algorithms / earlier search states / typical game-playing algorithm / search domain / search state / bandit algorithms / approximate solution / heuristic algorithms / bandit algorithm / flat sampling algorithms / game-playing search / computing / gametree search / approximate solutions / /
Organization
University of California / National Science Foundation / American Statistical Association / Israel Science Foundation / Stuart Russell Computer Science Division University / MIT / Royal Statistical Society / Machine Intelligence / Paul Ivanier Center for Robotics Research and Production Management / Tolpin and Solomon Eyal Shimony Department / Computer Science Ben-Gurion University of the Negev Beer Sheva / Carnegie-Mellon University / Pittsburgh / William Frankel Center for Computer Sciences / /
Person
Monte-Carlo Go / Oliver / Hall London / Solomon Eyal Shimony / Stuart Russell / Boyd / Chapman London / Nicholas Hay / /
Position
Bernoulli metalevel probability model / each arm / General / Dean / strong player / /
ProvinceOrState
Pennsylvania / California / /
PublishedMedium
Journal of the Royal Statistical Society / Machine Learning / Journal of the American Statistical Association / /
Selecting Computations: Theory and Applications Nicholas Hay and Stuart Russell Computer Science Division University of California Berkeley, CA 94720