25,161
edits
Changes
no edit summary
'''Aske Plaat''',<br/>
a Dutch computer scientiestand professor and scientific director of the Leiden institute for artificial intelligence and computer science (LIACS), [[Leiden University]]. In 1993 he started as a PhD student He studied [[Artificial Intelligence|artificial intelligence]] under the guidance of [[Jonathan Schaeffer]] at the [[University of Alberta]] , and [[Arie de Bruin]] and [[Wim Pijls]] at the [https://en.wikipedia.org/wiki/Erasmus_University_Rotterdam Erasmus UniversityRotterdam] Rotterdamwhere he obtained his Ph.D. in 1996. In 1997 he was a As postdoc at [[Massachusetts Institute of Technology|MIT's]] LCS, where he worked with [[Charles Leiserson]] and [[Don Dailey]] on [[Cilkchess]] at the Supercomputing Technologies Group. Until 1999 , he was researcher in the Computer Systems Group of the [https://en.wikipedia.org/wiki/Vrije_Universiteit Vrije Universiteit] in Amsterdam , where he worked with [[Henri Bal]] on Wide Area Algorithms[https://en.wikipedia.org/wiki/Distributed_algorithm distributed algorithms]. Next, he Aske Plaat worked in IT Governance at [https://en.wikipedia.org/wiki/PricewaterhouseCoopers PriceWaterhouse Coopers], and the [https://en.wikipedia.org/wiki/Ministry_of_Security_and_Justice_%28Netherlands%29 Ministry of Justice] in the , The Netherlands. Since October 2009 , he is professor of information and complex decision making at [[Tilburg University]]. Since , since 2014 he is professor of data science at the Leiden Centre of Data Science, Leiden Institute of Advanced Computer Science (LIACS), affiliated with [[Leiden University]]. Aske Plaat is creator of the [[MTD(f)]] <ref>[https://people.csail.mit.edu/plaat/mtdf.html - A Minimax Algorithm faster than NegaScout]</ref> search algorithm as applied in [[Cilkchess ]] <ref>[https://www.game-ai-forum.org/icga-tournaments/person.php?id=425 Aske Plaat's ICGA Tournaments]</ref>. He is deputy editor of the [[ICGA Journal|Journal of the International Computer Games Association]] [[ICGA]].
=See also=
=Selected Publications=
<ref>[http://ilk.uvt.nl/icga/journal/docs/References.pdf [ICGA Journal#RefDB|ICGA Reference Database] (pdf)]</ref> <ref>[httphttps://www.informatikdblp.uni-trier.de/~ley/pers/hd/p/Plaat:Aske dblp: Aske Plaat]</ref>
==1994==
* [[Aske Plaat]], [[Jonathan Schaeffer]], [[Wim Pijls]], [[Arie de Bruin]] ('''1994, 2014'''). ''Nearly Optimal Minimax Tree Search?'' Technical Report, [[University of Alberta]], [https://arxiv.org/abs/1404.1518 arXiv:1404.1518]
* [[Taichi Ishitobi]], [[Aske Plaat]], [[Hiroyuki Iida]], [[Jaap van den Herik]] ('''2015'''). ''Reducing the Seesaw Effect with Deep Proof Number Search''. [[Advances in Computer Games 14]]
* [[S. Ali Mirsoleimani]], [[Aske Plaat]], [[Jaap van den Herik]], [[Jos Vermaseren]] ('''2015'''). ''Scaling Monte Carlo Tree Search on Intel Xeon Phi''. [http://arxiv.org/abs/1507.04383 CoRR abs/1507.04383] » [[Hex]], [[Monte-Carlo Tree Search|MCTS]], [[Parallel Search]], [[x86-64]]
* [[S. Ali Mirsoleimani]], [[Aske Plaat]], [[Jaap van den Herik]], [[Jos Vermaseren]] ('''2015'''). ''Parallel Monte Carlo Tree Search from Multi-core to Many-core Processors''. [https://whova.com/portal/ieeet_201508/ TrustCom/BigDataSE/|ISPA 2015], [https://askeplaat.files.wordpress.com/2013/01/ispa2015.pdf pdf]
* [[S. Ali Mirsoleimani]], [[Aske Plaat]], [[Jaap van den Herik]] ('''2015'''). ''Ensemble UCT Needs High Exploitation''. [http://arxiv.org/abs/1509.08434 CoRR abs/1509.08434]
* [[Jaap van den Herik]], [[Walter Kosters]], [[Aske Plaat]], [[Johanna Hellemons]] ('''2015'''). ''The 18th Computer Olympiad 2015''. [[ICGA Journal#38_4|ICGA Journal, Vol. 38, No. 4]] » [[18th Computer Olympiad]]
'''2016'''
* [[S. Ali Mirsoleimani]], [[Aske Plaat]], [[Jaap van den Herik]], [[Jos Vermaseren]] ('''2016'''). ''A New Method for Parallel Monte Carlo Tree Search''. [https://arxiv.org/abs/1605.04447 arXiv:1605.04447] » [[Monte-Carlo Tree Search|MCTS]], [[Parallel Search]]
* [[S. Ali Mirsoleimani]], [[Aske Plaat]], [[Jaap van den Herik]], [[Jos Vermaseren]] ('''2016'''). ''An Efficient Computation Pattern for Parallel MCTS''. [http://www.ictopen.nl/content/Previous+editions ICT.OPEN 2016], [http://liacs.leidenuniv.nl/~plaata1/papers/ictopen2016.pdf pdf]
'''2017'''
* [[S. Ali Mirsoleimani]], [[Aske Plaat]], [[Jaap van den Herik]], [[Jos Vermaseren]] ('''2017'''). ''Structured Parallel Programming for Monte Carlo Tree Search''. [https://arxiv.org/abs/1704.00325 arXiv:1704.00325]
* [[S. Ali Mirsoleimani]], [[Aske Plaat]], [[Jaap van den Herik]], [[Jos Vermaseren]] ('''2017'''). ''An Analysis of Virtual Loss in Parallel MCTS''. [https://dblp.uni-trier.de/db/conf/icaart/icaart2017-2.html ICAART 2017], Vol. 2, [http://liacs.leidenuniv.nl/~plaata1/papers/paper_ICAART17.pdf pdf]
'''2018'''
* [[Hui Wang]], [[Michael Emmerich]], [[Aske Plaat]] ('''2018'''). ''Monte Carlo Q-learning for General Game Playing''. [https://arxiv.org/abs/1802.05944 arXiv:1802.05944] » [[Monte-Carlo Tree Search|MCTS]], [[Reinforcement Learning]], [[General Game Playing]]
* [[Hui Wang]], [[Michael Emmerich]], [[Aske Plaat]] ('''2018'''). ''Assessing the Potential of Classical Q-learning in General Game Playing''. [https://arxiv.org/abs/1810.06078 arXiv:1810.06078]
* [[S. Ali Mirsoleimani]], [[Jaap van den Herik]], [[Aske Plaat]], [[Jos Vermaseren]] ('''2018'''). ''Pipeline Pattern for Parallel MCTS''. [https://dblp.uni-trier.de/db/conf/icaart/icaart2018-2.html ICAART 2018], [http://liacs.leidenuniv.nl/~plaata1/papers/paper_ICAART18_pos.pdf pdf]
* [[S. Ali Mirsoleimani]], [[Jaap van den Herik]], [[Aske Plaat]], [[Jos Vermaseren]] ('''2018'''). ''A Lock-free Algorithm for Parallel MCTS''. [https://dblp.uni-trier.de/db/conf/icaart/icaart2018-2.html ICAART 2018], [http://liacs.leidenuniv.nl/~plaata1/papers/paper_ICAART18.pdf pdf]
=External Links=
