Difference between revisions of "Olivier Teytaud"

From Chessprogramming wiki
Jump to: navigation, search
(Created page with "'''Home * People * Olivier Teytaud''' border|right|thumb|Olivier Teytaud <ref>Image from Biography in [[Chang-Shing Lee, Mei-Hui Wang...")
 
Line 44: Line 44:
 
* [[Cheng-Wei Chou]], [[Ping-Chiang Chou]], [[Hassen Doghmen]], [[Chang-Shing Lee]], [[Tsan-Cheng Su]], [[Fabien Teytaud]], [[Olivier Teytaud]], [[Hui-Ming Wang]], [[Mei-Hui Wang]], [[Li-Wen Wu]], [[Shi-Jim Yen]] ('''2011'''). ''[http://link.springer.com/chapter/10.1007/978-3-642-31866-5_8 Towards a Solution of 7x7 Go with Meta-MCTS]''. [[Advances in Computer Games 13]]
 
* [[Cheng-Wei Chou]], [[Ping-Chiang Chou]], [[Hassen Doghmen]], [[Chang-Shing Lee]], [[Tsan-Cheng Su]], [[Fabien Teytaud]], [[Olivier Teytaud]], [[Hui-Ming Wang]], [[Mei-Hui Wang]], [[Li-Wen Wu]], [[Shi-Jim Yen]] ('''2011'''). ''[http://link.springer.com/chapter/10.1007/978-3-642-31866-5_8 Towards a Solution of 7x7 Go with Meta-MCTS]''. [[Advances in Computer Games 13]]
 
* [[David L. St-Pierre]], [[Quentin Louveaux]], [[Olivier Teytaud]] ('''2011'''). ''[http://link.springer.com/chapter/10.1007/978-3-642-31866-5_25 Online Sparse Bandit for Card Games]''. [[Advances in Computer Games 13]]
 
* [[David L. St-Pierre]], [[Quentin Louveaux]], [[Olivier Teytaud]] ('''2011'''). ''[http://link.springer.com/chapter/10.1007/978-3-642-31866-5_25 Online Sparse Bandit for Card Games]''. [[Advances in Computer Games 13]]
 +
* [[Adrien Couëtoux]], [[Jean-Baptiste Hoock]], [[Nataliya Sokolovska]], [[Olivier Teytaud]], [[Nicolas Bonnard]] ('''2011'''). ''Continuous Upper Confidence Trees''. [https://dblp.uni-trier.de/db/conf/lion/lion2011.html LION 2011], [https://hal.archives-ouvertes.fr/hal-00542673v1/document pdf]
 
'''2012'''
 
'''2012'''
 
* [[Sylvain Gelly]], [[Marc Schoenauer]], [[Michèle Sebag]], [[Olivier Teytaud]], [[Levente Kocsis]], [[David Silver]], [[Csaba Szepesvári]] ('''2012'''). ''[http://dl.acm.org/citation.cfm?id=2093548.2093574 The Grand Challenge of Computer Go: Monte Carlo Tree Search and Extensions]''. [[ACM#Communications|Communications of the ACM]], Vol. 55, No. 3, [http://www0.cs.ucl.ac.uk/staff/D.Silver/web/Applications_files/grand-challenge.pdf pdf preprint]
 
* [[Sylvain Gelly]], [[Marc Schoenauer]], [[Michèle Sebag]], [[Olivier Teytaud]], [[Levente Kocsis]], [[David Silver]], [[Csaba Szepesvári]] ('''2012'''). ''[http://dl.acm.org/citation.cfm?id=2093548.2093574 The Grand Challenge of Computer Go: Monte Carlo Tree Search and Extensions]''. [[ACM#Communications|Communications of the ACM]], Vol. 55, No. 3, [http://www0.cs.ucl.ac.uk/staff/D.Silver/web/Applications_files/grand-challenge.pdf pdf preprint]
Line 54: Line 55:
 
* [[Olivier Teytaud]], [[Abdallah Saffidine]], [[Shi-Jim Yen]] ('''2015'''). ''The complexities of Go''. [[Advances in Computer Games 14]]
 
* [[Olivier Teytaud]], [[Abdallah Saffidine]], [[Shi-Jim Yen]] ('''2015'''). ''The complexities of Go''. [[Advances in Computer Games 14]]
 
* [[Jialin Liu]], [[Olivier Teytaud]], [[Tristan Cazenave]] ('''2016'''). ''Fast seed-learning algorithms for games''. [[CG 2016]]
 
* [[Jialin Liu]], [[Olivier Teytaud]], [[Tristan Cazenave]] ('''2016'''). ''Fast seed-learning algorithms for games''. [[CG 2016]]
 +
* [[David L. St-Pierre]], [[Jean-Baptiste Hoock]], [[Jialin Liu]], [[Fabien Teytaud]], [[Olivier Teytaud]] ('''2016'''). ''Automatically Reinforcing a Game AI''. [https://arxiv.org/abs/1607.08100 arXiv:1607.0810] » [[Monte-Carlo Tree Search|MCTS]]
  
 
=External Links=  
 
=External Links=  

Revision as of 17:40, 6 March 2019

Home * People * Olivier Teytaud

Olivier Teytaud [1]

Olivier Teytaud,
a French computer scientist and researcher in TAO [2] , INRIA Saclay-IDF, CNRS, Laboratoire de Recherche en Informatique (LRI), Paris-Sud University. His research covers planning, machine learning, dynamic and genetic programming, optimization, and operational research. Olivier Teytaud is co-author of the Havannah programs Shakti and Shakty, and co-author of the Go playing program Mogo, using Monte-Carlo Tree Search which uses patterns in the simulations and improvements in UCT [3].

Selected Publications

[4]

2006 ...

2007

2008

2009

2010 ...

2011

2012

2013

2015 ...

External Links

References

Up one level