25,161
edits
Changes
Created page with "'''Home * People * Jean Méhat''' FILE:JeanMehat.jpg|border|right|thumb|240px|link=http://www.ai.univ-paris8.fr/%7Ejm/ | Jean Méhat <ref>[http://www.ai...."
'''[[Main Page|Home]] * [[People]] * Jean Méhat'''
[[FILE:JeanMehat.jpg|border|right|thumb|240px|link=http://www.ai.univ-paris8.fr/%7Ejm/
| Jean Méhat <ref>[http://www.ai.univ-paris8.fr/%7Ejm/ Jean Méhat Home Page]</ref>
]]
'''Jean Méhat''',<br/>
a French computer scientist and associate professor at [[University of Paris#8|Paris 8 University]], LIASD. His research interests include [[Search|search algorithms]], in particular [[Parallel Search|parallel]] [[Monte-Carlo Tree Search|Monte-Carlo tree search]] along with [[General Game Playing|general game playing]].
In 2009, Jean Méhat and [[Tristan Cazenave]] won the general game playing competition <ref>[http://www.ru.is/faculty/yngvi/GIGA09/ggpc2009.html General Game Playing Competition 2009]</ref> at [[Conferences#IJCAI2009|IJCAI 2009]] with their program ''Ary'' <ref>[[Jean Méhat]], [[Tristan Cazenave]] ('''2008'''). ''Ary: A Program for General Game Playing''. [http://www.lamsade.dauphine.fr/%7Ecazenave/papers/poster2008.pdf pdf]</ref>, applying ''Nested Monte-Carlo search'' <ref>[[Tristan Cazenave]] ('''2009'''). ''Nested Monte-Carlo Search''. [[Conferences#IJCAI2009|IJCAI 2009]], [https://www.lamsade.dauphine.fr/%7Ecazenave/papers/nested.pdf pdf]</ref> .
=Selected Publications=
<ref>[https://dblp.uni-trier.de/pers/hd/m/M=eacute=hat:Jean.html dblp: Jean Méhat]</ref>
==2008 ...==
* [[Jean Méhat]], [[Tristan Cazenave]] ('''2008'''). ''Ary: A Program for General Game Playing''. [https://www.lamsade.dauphine.fr/%7Ecazenave/papers/poster2008.pdf pdf]
* [[Jean Méhat]], [[Tristan Cazenave]] ('''2008'''). ''Monte-Carlo Tree Search for General Game Playing''. [https://www.lamsade.dauphine.fr/%7Ecazenave/papers/ggp2008.pdf pdf]
==2010 ...==
* [[Abdallah Saffidine]], [[Tristan Cazenave]], [[Jean Méhat]] ('''2010'''). ''UCD : Upper Confidence bound for rooted Directed acyclic graphs''. TAAI IWCG, [http://www.lamsade.dauphine.fr/%7Ecazenave/papers/taai2010-final.pdf pdf]
* [[Jean Méhat]], [[Tristan Cazenave]] ('''2010'''). ''Combining UCT and Nested Monte-Carlo Search for Single-Player General Game Playing''. [[IEEE#TOCIAIGAMES|IEEE Transactions on Computational Intelligence and AI in Games]], Vol. 2, No. 4, [http://www.lamsade.dauphine.fr/%7Ecazenave/papers/ggp2009.pdf pdf preprint]
* [[Jean Méhat]] ('''2010'''). ''Réseaux et transmissions de données Licence d'informatique deuxième année''. [[University of Paris#8|Paris 8 University]], [http://www.ai.univ-paris8.fr/~jm/reso.pdf pdf]
* [[Jean Méhat]], [[Tristan Cazenave]] ('''2011'''). ''A Parallel General Game Player''. [http://www.kuenstliche-intelligenz.de/ KI Journal], Vol. 25, No. 1, [https://www.lamsade.dauphine.fr/~cazenave/papers/rootparallelggp.pdf pdf]
* [[Tristan Cazenave]], [[Jean Méhat]], [[Mark Winands]] (eds.) ('''2012'''). ''Computer Games Workshop at ECAI 2012''. [[ECAI CGW 2012]], [http://www2.lirmm.fr/ecai2012/images/stories/ecai_doc/pdf/workshop/W33_ComputerGames.pdf pdf]
* [[Abdallah Saffidine]], [[Tristan Cazenave]], [[Jean Méhat]] ('''2012'''). ''UCD : Upper confidence bound for rooted directed acyclic graphs''. [https://dblp.uni-trier.de/db/journals/kbs/kbs34.html 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]], [https://hal.archives-ouvertes.fr/hal-01714440/document pdf]
* [[Jean-Noël Vittaut]], [[Jean Méhat]] ('''2014'''). ''[https://link.springer.com/chapter/10.1007/978-3-319-14923-3_8 Efficient Grounding of Game Descriptions with Tabling]''. [[ECAI CGW 2014]]
=External Links=
* [http://www.ai.univ-paris8.fr/%7Ejm/ Jean Méhat Home Page]
=References=
<references />
'''[[People|Up one level]]'''
[[Category:Researcher|Méhat]]
[[Category:Programmer|Méhat]]
[[FILE:JeanMehat.jpg|border|right|thumb|240px|link=http://www.ai.univ-paris8.fr/%7Ejm/
| Jean Méhat <ref>[http://www.ai.univ-paris8.fr/%7Ejm/ Jean Méhat Home Page]</ref>
]]
'''Jean Méhat''',<br/>
a French computer scientist and associate professor at [[University of Paris#8|Paris 8 University]], LIASD. His research interests include [[Search|search algorithms]], in particular [[Parallel Search|parallel]] [[Monte-Carlo Tree Search|Monte-Carlo tree search]] along with [[General Game Playing|general game playing]].
In 2009, Jean Méhat and [[Tristan Cazenave]] won the general game playing competition <ref>[http://www.ru.is/faculty/yngvi/GIGA09/ggpc2009.html General Game Playing Competition 2009]</ref> at [[Conferences#IJCAI2009|IJCAI 2009]] with their program ''Ary'' <ref>[[Jean Méhat]], [[Tristan Cazenave]] ('''2008'''). ''Ary: A Program for General Game Playing''. [http://www.lamsade.dauphine.fr/%7Ecazenave/papers/poster2008.pdf pdf]</ref>, applying ''Nested Monte-Carlo search'' <ref>[[Tristan Cazenave]] ('''2009'''). ''Nested Monte-Carlo Search''. [[Conferences#IJCAI2009|IJCAI 2009]], [https://www.lamsade.dauphine.fr/%7Ecazenave/papers/nested.pdf pdf]</ref> .
=Selected Publications=
<ref>[https://dblp.uni-trier.de/pers/hd/m/M=eacute=hat:Jean.html dblp: Jean Méhat]</ref>
==2008 ...==
* [[Jean Méhat]], [[Tristan Cazenave]] ('''2008'''). ''Ary: A Program for General Game Playing''. [https://www.lamsade.dauphine.fr/%7Ecazenave/papers/poster2008.pdf pdf]
* [[Jean Méhat]], [[Tristan Cazenave]] ('''2008'''). ''Monte-Carlo Tree Search for General Game Playing''. [https://www.lamsade.dauphine.fr/%7Ecazenave/papers/ggp2008.pdf pdf]
==2010 ...==
* [[Abdallah Saffidine]], [[Tristan Cazenave]], [[Jean Méhat]] ('''2010'''). ''UCD : Upper Confidence bound for rooted Directed acyclic graphs''. TAAI IWCG, [http://www.lamsade.dauphine.fr/%7Ecazenave/papers/taai2010-final.pdf pdf]
* [[Jean Méhat]], [[Tristan Cazenave]] ('''2010'''). ''Combining UCT and Nested Monte-Carlo Search for Single-Player General Game Playing''. [[IEEE#TOCIAIGAMES|IEEE Transactions on Computational Intelligence and AI in Games]], Vol. 2, No. 4, [http://www.lamsade.dauphine.fr/%7Ecazenave/papers/ggp2009.pdf pdf preprint]
* [[Jean Méhat]] ('''2010'''). ''Réseaux et transmissions de données Licence d'informatique deuxième année''. [[University of Paris#8|Paris 8 University]], [http://www.ai.univ-paris8.fr/~jm/reso.pdf pdf]
* [[Jean Méhat]], [[Tristan Cazenave]] ('''2011'''). ''A Parallel General Game Player''. [http://www.kuenstliche-intelligenz.de/ KI Journal], Vol. 25, No. 1, [https://www.lamsade.dauphine.fr/~cazenave/papers/rootparallelggp.pdf pdf]
* [[Tristan Cazenave]], [[Jean Méhat]], [[Mark Winands]] (eds.) ('''2012'''). ''Computer Games Workshop at ECAI 2012''. [[ECAI CGW 2012]], [http://www2.lirmm.fr/ecai2012/images/stories/ecai_doc/pdf/workshop/W33_ComputerGames.pdf pdf]
* [[Abdallah Saffidine]], [[Tristan Cazenave]], [[Jean Méhat]] ('''2012'''). ''UCD : Upper confidence bound for rooted directed acyclic graphs''. [https://dblp.uni-trier.de/db/journals/kbs/kbs34.html 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]], [https://hal.archives-ouvertes.fr/hal-01714440/document pdf]
* [[Jean-Noël Vittaut]], [[Jean Méhat]] ('''2014'''). ''[https://link.springer.com/chapter/10.1007/978-3-319-14923-3_8 Efficient Grounding of Game Descriptions with Tabling]''. [[ECAI CGW 2014]]
=External Links=
* [http://www.ai.univ-paris8.fr/%7Ejm/ Jean Méhat Home Page]
=References=
<references />
'''[[People|Up one level]]'''
[[Category:Researcher|Méhat]]
[[Category:Programmer|Méhat]]
