Jean+Méhat

a French computer scientist and Associate Professor at [|Paris 8 University], LIASD. His research interests include Search algorithms, Parallel search, and 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//. || toc =Selected Publications=
 * Home * People * Jean Méhat**
 * [[image:jm.jpg link="http://www.ai.univ-paris8.fr/%7Ejm/"]] ||~  || **Jean Méhat**,
 * Jean Méhat ||~  ||^   ||

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 2009]
 * 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

=External Links=
 * [|Jean Méhat Home Page]

=References= =What links here?= include page="Jean Méhat" component="backlinks" limit="40"
 * Up one level**