Nombre de documents

33

CV de Fabien Teytaud


Communication dans un congrès27 documents

  • Joris Duguépéroux, Ahmad Mazyad, Fabien Teytaud, Julien Dehos. Pruning playouts in Monte-Carlo Tree Search for the game of Havannah. The 9th International Conference on Computers and Games (CG2016), Jun 2016, Leiden, Netherlands. <https://cg2016leiden.wordpress.com/>. <hal-01342347>
  • Marie-Liesse Cauwet, Olivier Teytaud, Shih-Yuan Chiu, Kuo-Min Lin, Shi-Jim Yen, et al.. Parallel Evolutionary Algorithms Performing Pairwise Comparisons. Jun He and Thomas Jansen and Gabriela Ochoa and Christine Zarges. Foundations of Genetic Algorithms, 2015, Aberythswyth, United Kingdom. ACM, pp.99-113 2015, Foundations of Genetic Algorithms. <hal-01077626>
  • Shih-Yuan Chiu, Ching-Nung Lin, Jialin Liu, Tsang-Cheng Su, Fabien Teytaud, et al.. Differential Evolution for Strongly Noisy Optimization: Use 1.01$^n$ Resamplings at Iteration n and Reach the -1/2 Slope. 2015 IEEE Congress on Evolutionary Computation (IEEE CEC), May 2015, Sendai, Japan. 2015, <http://www.cec2015.org>. <hal-01120892>
  • Shih-Yuan Chiu, Ching-Nung Lin, Jialin Liu, Tsang-Cheng Su, Fabien Teytaud, et al.. Differential evolution for strongly noisy optimization: Use 1.01n resamplings at iteration n and reach the − 1/2 slope. 2015 IEEE Congress on Evolutionary Computation (IEEE CEC 2015), May 2015, Sendai, Japan. pp.338 - 345, 2015, <10.1109/CEC.2015.7256911>. <hal-01245526>
  • Denis Robilliard, Cyril Fonlupt, Fabien Teytaud. Monte-Carlo Tree Search for the Game of "7 Wonders". European Conference in Artificial Intelligence (ECAI), Aug 2014, Prague, Czech Republic. pp.64 - 77, 2014, Computer Game Workshop <10.1007/978-3-319-14923-3_5>. <hal-01406496>
  • Arpad Rimmel, Fabien Teytaud. A Survey of Meta-Heuristics used for Computing Maximin Latin Hypercube. EvoCOP 2014, Apr 2014, Grenade, Spain. 12 p., 2014. <hal-00926729>
  • Shalom Eliahou, Cyril Fonlupt, Jean Fromentin, Virginie Marion-Poty, Denis Robilliard, et al.. Investigating Monte-Carlo Methods on the Weak Schur Problem. EvoCop, Apr 2013, Vienne, Austria. pp.191 - 201, 2013, <10.1007/978-3-642-37198-1_17>. <hal-01406479>
  • Tristan Cazenave, Fabien Teytaud. Application of the Nested Rollout Policy Adaptation Algorithm to the Traveling Salesman Problem with Time Windows. LION, Jan 2012, Paris, France. pp.42 - 54, 2012, Learning and Intelligent Optimization. <10.1007/978-3-642-34413-8_4>. <hal-01406457>
  • Tristan Cazenave, Fabien Teytaud. Beam Nested Rollout Policy Adaptation. ECAI, Aug 2012, Montpellier, France. 2012, Computer Games Workshop, ECAI. <hal-01406471>
  • Arpad Rimmel, Fabien Teytaud, Tristan Cazenave. Optimization of the Nested Monte-Carlo Algorithm on the Traveling Salesman Problem with Time Windows. Evostar, Apr 2011, Turin, Italy. 2011. <inria-00563668>
  • Marc Schoenauer, Fabien Teytaud, Olivier Teytaud. A Rigorous Runtime Analysis for Quasi-Random Restarts and Decreasing Stepsize. Artificial Evolution, Oct 2011, Angers, France. 2011. <inria-00625855>
  • Ping-Chiang Chou, Hassen Doghmen, Chang-Shing Lee, Fabien Teytaud, Olivier Teytaud, et al.. Computational and Human Intelligence in Blind Go.. Computational Intelligence and Games, Aug 2011, Seoul, North Korea. 2011. <inria-00625849>
  • Benard Helmstetter, Chang-Shing Lee, Fabien Teytaud, Olivier Teytaud, Wang Mei-Hui, et al.. Random positions in Go. Computational Intelligence and Games, Aug 2011, Seoul, North Korea. 2011. <inria-00625815>
  • Fabien Teytaud, Olivier Teytaud. Lemmas on Partial Observation, with Application to Phantom Games. Computational Intelligence and Games, Aug 2011, Seoul, North Korea. 2011. <inria-00625794>
  • Cheng-Wei Chou, Li-Wen Wu, Hui-Min Wang, Fabien Teytaud, Olivier Teytaud, et al.. Towards a solution of 7x7 Go with Meta-MCTS. Advances in Computer Games, 2011, Tilburg, Netherlands. International Conference on Computers and Games 2011, pp.12, 2012, International Conference on Computers and Games 2011. <hal-01077624>
  • Amine Bourki, Guillaume Chaslot, Matthieu Coulm, Vincent Danjean, Hassen Doghmen, et al.. Scalability and Parallelization of Monte-Carlo Tree Search. The International Conference on Computers and Games 2010, Sep 2010, Kanazawa, Japan. 2010. <inria-00512854>
  • Fabien Teytaud, Olivier Teytaud. On the Huge Benefit of Decisive Moves in Monte-Carlo Tree Search Algorithms. IEEE Conference on Computational Intelligence and Games, Aug 2010, Copenhagen, Denmark. 2010. <inria-00495078>
  • Arpad Rimmel, Fabien Teytaud, Olivier Teytaud. Biasing Monte-Carlo Simulations through RAVE Values. The International Conference on Computers and Games 2010, Sep 2010, Kanazawa, Japan. 2010. <inria-00485555>
  • Fabien Teytaud, Olivier Teytaud. Log(lambda) Modifications for Optimal Parallelism. Parallel Problem Solving From Nature, Sep 2010, Krakow, Poland. 2010. <inria-00495087>
  • Fabien Teytaud, Olivier Teytaud. Du jeu de Go au Havannah : variantes d'UCT et coups décisifs. RFIA, Jan 2010, Caen, France. 2009. <inria-00454541>
  • Arpad Rimmel, Fabien Teytaud. Multiple Overlapping Tiles for Contextual Monte Carlo Tree Search. Evostar, Apr 2010, Istanbul, Turkey. 2010. <inria-00456422v2>
  • Fabien Teytaud. A new selection ratio for large population sizes. Evostar, Apr 2010, Istanbul, Turkey. 2010. <inria-00456335>
  • Fabien Teytaud, Olivier Teytaud. Bias and variance in continuous EDA. EA 09, Oct 2009, Strasbourg, France. 2009. <inria-00451416>
  • Guillaume Chaslot, Jean-Baptiste Hoock, Fabien Teytaud, Olivier Teytaud. On the huge benefit of quasi-random mutations for multimodal optimization with application to grid-based tuning of neurocontrollers. ESANN, Apr 2009, Bruges, Belgium. 2009. <inria-00380125>
  • Fabien Teytaud, Olivier Teytaud. Creating an Upper-Confidence-Tree program for Havannah. ACG 12, May 2009, Pamplona, Spain. 2009. <inria-00380539>
  • Fabien Teytaud, Olivier Teytaud. On the parallel speed-up of Estimation of Multivariate Normal Algorithm and Evolution Strategies. EvoNum (evostar workshop), 2009, Tuebingen, Germany. springer, EvoNum, 2009, Proceedings of EvoStar workshop 2009. <inria-00369781>
  • Fabien Teytaud, Olivier Teytaud. Why one must use reweighting in Estimation Of Distribution Algorithms. GECCO, 2009, Montréal, Canada. 2009. <inria-00369780>

Mémoire d'étudiant1 document

  • Fabien Teytaud. Optimisation évolutionnaire parallèle. Algorithme et structure de données [cs.DS]. 2008. <dumas-00350003>

Article dans une revue4 documents

  • Ahmad Mazyad, Fabien Teytaud, Cyril Fonlupt. Monte-Carlo Tree Search for the “Mr Jack” Board Game. International Journal on Soft Computing, Artificial Intelligence and Applications (IJSCAI) , 2015. <hal-01406506>
  • Fabien Teytaud, Julien Dehos. On the tactical and strategic behaviour of MCTS when biasing random simulations. ICGA Journal, ICGA, 2015, 38 (2), pp.67-80. <hal-01267056>
  • Shih-Yuan Chiu, Hassen Doghmen, Chang-Shing Lee, Fabien Teytaud, Olivier Teytaud, et al.. Human vs. Computer Go Competition in FUZZ-IEEE 2011. ICGA Journal, ICGA, 2011, 34 (4), pp.243-247. <hal-00766202>
  • Jean-Baptiste Hoock, Chang-Shing Lee, Arpad Rimmel, Fabien Teytaud, Olivier Teytaud, et al.. Intelligent Agents for the Game of Go. IEEE Computational Intelligence Magazine, Institute of Electrical and Electronics Engineers, 2010. <inria-00544758v2>

Poster1 document

  • Fabien Teytaud, Marc Schoenauer, Olivier Teytaud. Simple Tools for Multimodal Optimization. GECCO - 13th annual conference companion on genetic and evolutionary computation, Jul 2011, Dublin, Ireland. 2011, Proceedings of the 13th annual conference companion on genetic and evolutionary computation. <hal-01406444>