Revision as of 22:33, 5 March 2019

Home * People * Jos Vermaseren

Jos Vermaseren ^[1]

Jos A. M. Vermaseren,
a Dutch theorecial physicist and researcher at the theory group of Nikhef at Amsterdam Science Park. His research interests include phenomenology of particles, perturbative calculations and computer algebra, and he is original author of the open source ^[2] symbolic manipulation system FORM ^[3]. He holds a 4th dan in Go, has a small art collection and a far going fascination for Japanese food and drinks.

HEPGAME

Jos Vermaseren proposed the HEPGAME ^[4] ^[5], to solve extremely complicated equations in high energy physics urgently needed to make optimal use of upcoming experimental data from the Large Hadron Collider at CERN in Geneva, awarded by the European Research Council with the ERC advanced grant in 2012. The idea is to use insights from artificial intelligence like Monte-Carlo Tree Search and UCT, worked out in collaboration with Jaap van den Herik and Aske Plaat at Leiden University. The grant will fund two postdoc positions for a duration of five years at Nikhef, and in addition two Ph.D. positions at Leiden University ^[6].

Jos Vermaseren (1991). Symbolic manipulation with FORM. A note on computing the regular solutions of linear differential systems

Jos Vermaseren (2011). FORM development. CoRR abs/1101.0511
Jan Kuipers, Aske Plaat, Jos Vermaseren, Jaap van den Herik (2012). Improving multivariate Horner schemes with Monte Carlo tree search. CoRR abs/1207.7079
Ben Ruijl, Jos Vermaseren, Aske Plaat, Jaap van den Herik (2013). Combining Simulated Annealing and Monte Carlo Tree Search for Expression Simplification. CoRR abs/1312.0841
Ben Ruijl, Jos Vermaseren, Aske Plaat, Jaap van den Herik (2014). HEPGAME and the Simplification of Expressions. CoRR abs/1405.6369
S. Ali Mirsoleimani, Aske Plaat, Jaap van den Herik, Jos Vermaseren (2014). Performance analysis of a 240 thread tournament level MCTS Go program on the Intel Xeon Phi. CoRR abs/1409.4297 » Go, MCTS
Ben Ruijl, Jos Vermaseren, Aske Plaat, Jaap van den Herik (2014). Why Local Search Excels in Expression Simplification. CoRR abs/1409.5223

@@ Line 27: / Line 27: @@
 * [[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]], [[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]
 * [[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]