| Creating an upper-confidence-tree program for Havannah F Teytaud, O Teytaud Advances in Computer Games, 65-74, 2009 | 68 | 2009 |
| Scalability and parallelization of monte-carlo tree search A Bourki, G Chaslot, M Coulm, V Danjean, H Doghmen, JB Hoock, ... International Conference on Computers and Games, 48-58, 2010 | 53 | 2010 |
| Optimization of the nested monte-carlo algorithm on the traveling salesman problem with time windows A Rimmel, F Teytaud, T Cazenave European Conference on the Applications of Evolutionary Computation, 501-510, 2011 | 49 | 2011 |
| Biasing Monte-Carlo simulations through RAVE values A Rimmel, F Teytaud, O Teytaud International Conference on Computers and Games, 59-68, 2010 | 48 | 2010 |
| Intelligent agents for the game of Go JB Hoock, CS Lee, A Rimmel, F Teytaud, MH Wang, O Teytaud IEEE Computational Intelligence Magazine 5 (4), 28-42, 2010 | 37 | 2010 |
| Algorithm and knowledge engineering for the TSPTW problem S Edelkamp, M Gath, T Cazenave, F Teytaud 2013 IEEE Symposium on Computational Intelligence in Scheduling (CISched), 44-51, 2013 | 33 | 2013 |
| On the huge benefit of decisive moves in Monte-Carlo Tree Search algorithms F Teytaud, O Teytaud Proceedings of the 2010 IEEE Conference on Computational Intelligence and …, 2010 | 31 | 2010 |
| Multiple overlapping tiles for contextual Monte Carlo tree search A Rimmel, F Teytaud European Conference on the Applications of Evolutionary Computation, 201-210, 2010 | 25 | 2010 |
| Application of the nested rollout policy adaptation algorithm to the traveling salesman problem with time windows T Cazenave, F Teytaud International Conference on Learning and Intelligent Optimization, 42-54, 2012 | 24 | 2012 |
| Monte-carlo tree search for the game of “7 wonders” D Robilliard, C Fonlupt, F Teytaud Workshop on Computer Games, 64-77, 2014 | 18 | 2014 |
| Why one must use reweighting in estimation of distribution algorithms F Teytaud, O Teytaud Proceedings of the 11th Annual conference on Genetic and evolutionary …, 2009 | 18 | 2009 |
| A rigorous runtime analysis for quasi-random restarts and decreasing stepsize M Schoenauer, F Teytaud, O Teytaud International Conference on Artificial Evolution (Evolution Artificielle), 37-48, 2011 | 15 | 2011 |
| Investigating Monte-Carlo methods on the weak Schur problem S Eliahou, C Fonlupt, J Fromentin, V Marion-Poty, D Robilliard, F Teytaud European Conference on Evolutionary Computation in Combinatorial …, 2013 | 14 | 2013 |
| On the parallel speed-up of Estimation of Multivariate Normal Algorithm and Evolution Strategies F Teytaud, O Teytaud Workshops on Applications of Evolutionary Computation, 655-664, 2009 | 11 | 2009 |
| Lemmas on partial observation, with application to phantom games F Teytaud, O Teytaud 2011 IEEE Conference on Computational Intelligence and Games (CIG'11), 243-249, 2011 | 10 | 2011 |
| A new selection ratio for large population sizes F Teytaud European Conference on the Applications of Evolutionary Computation, 452-460, 2010 | 10 | 2010 |
| On the huge benefit of quasi-random mutations for multimodal optimization with application to grid-based tuning of neurocontrollers G Chaslot, JB Hoock, F Teytaud, O Teytaud | 10 | 2009 |
| Learning opening books in partially observable games: using random seeds in phantom go T Cazenave, J Liu, F Teytaud, O Teytaud 2016 IEEE Conference on Computational Intelligence and Games (CIG), 1-7, 2016 | 9 | 2016 |
| A survey of meta-heuristics used for computing maximin latin hypercube A Rimmel, F Teytaud European Conference on Evolutionary Computation in Combinatorial …, 2014 | 9 | 2014 |
| Towards a solution of 7x7 go with meta-MCTS CW Chou, PC Chou, H Doghmen, CS Lee, TC Su, F Teytaud, O Teytaud, ... Advances in Computer Games, 84-95, 2011 | 9 | 2011 |
Olivier TeytaudfacebookVerified email at fb.com
