暂无分享,去创建一个
Michael Buro | Douglas Rebstock | Christopher Solinas | M. Buro | Douglas Rebstock | Christopher Solinas
[1] Lutz Prechelt,et al. Automatic early stopping using cross validation: quantifying the criteria , 1998, Neural Networks.
[2] Noam Brown,et al. Superhuman AI for heads-up no-limit poker: Libratus beats top professionals , 2018, Science.
[3] Kevin Waugh,et al. DeepStack: Expert-level artificial intelligence in heads-up no-limit poker , 2017, Science.
[4] Nathan R. Sturtevant,et al. Understanding the Success of Perfect Information Monte Carlo Sampling in Game Tree Search , 2010, AAAI.
[5] Danna Zhou,et al. d. , 1934, Microbial pathogenesis.
[6] Yuan Yu,et al. TensorFlow: A system for large-scale machine learning , 2016, OSDI.
[7] Sepp Hochreiter,et al. Fast and Accurate Deep Network Learning by Exponential Linear Units (ELUs) , 2015, ICLR.
[8] Sam Devlin,et al. Emulating Human Play in a Leading Mobile Card Game , 2019, IEEE Transactions on Games.
[9] Tsuyoshi Murata,et al. {m , 1934, ACML.
[10] Peter I. Cowling,et al. Information Set Monte Carlo Tree Search , 2012, IEEE Transactions on Computational Intelligence and AI in Games.
[11] Mark Richards,et al. Opponent Modeling in Scrabble , 2007, IJCAI.
[12] Michael Buro,et al. Recursive Monte Carlo search for imperfect information games , 2013, 2013 IEEE Conference on Computational Inteligence in Games (CIG).
[13] Matthew L. Ginsberg,et al. GIB: Imperfect Information in a Computationally Challenging Game , 2011, J. Artif. Intell. Res..
[14] Nathan R. Sturtevant,et al. AN ANALYSIS OF UCT IN MULTI-PLAYER GAMES , 2008 .
[15] Nitish Srivastava,et al. Dropout: a simple way to prevent neural networks from overfitting , 2014, J. Mach. Learn. Res..
[16] Ian Frank,et al. Search in Games with Incomplete Information: A Case Study Using Bridge Card Play , 1998, Artificial Intelligence.