Jean Méhat

Home * People * Jean Méhat

Jean Méhat

Jean Méhat,
a French computer scientist and associate professor at Paris 8 University, LIASD. His research interests include search algorithms, in particular parallel Monte-Carlo tree search along with general game playing. In 2009, Jean Méhat and Tristan Cazenave won the general game playing competition at IJCAI 2009 with their program Ary , applying Nested Monte-Carlo search .

Selected Publications

2008 ...

• Jean Méhat, Tristan Cazenave (2008). Ary: A Program for General Game Playing. pdf
• Jean Méhat, Tristan Cazenave (2008). Monte-Carlo Tree Search for General Game Playing. pdf

2010 ...

• Abdallah Saffidine, Tristan Cazenave, Jean Méhat (2010). UCD : Upper Confidence bound for rooted Directed acyclic graphs. TAAI IWCG, pdf
• Jean Méhat, Tristan Cazenave (2010). Combining UCT and Nested Monte-Carlo Search for Single-Player General Game Playing. IEEE Transactions on Computational Intelligence and AI in Games, Vol. 2, No. 4, pdf preprint
• Jean Méhat (2010). Réseaux et transmissions de données Licence d'informatique deuxième année. Paris 8 University, pdf
• Jean Méhat, Tristan Cazenave (2011). A Parallel General Game Player. KI Journal, Vol. 25, No. 1, pdf
• Tristan Cazenave, Jean Méhat, Mark Winands (eds.) (2012). Computer Games Workshop at ECAI 2012. ECAI CGW 2012, pdf
• Abdallah Saffidine, Tristan Cazenave, Jean Méhat (2012). UCD : Upper confidence bound for rooted directed acyclic graphs. Knowledge Based Systems, Vol. 34
• Jean-Noël Vittaut, Jean Méhat (2014). Fast Instantiation of GGP Game Descriptions Using Prolog with Tabling. ECAI CGW 2014, pdf
• Jean-Noël Vittaut, Jean Méhat (2014). Efficient Grounding of Game Descriptions with Tabling. ECAI CGW 2014

External Links

• Jean Méhat Home Page

References

Up one level