Difference between revisions of "S. Ali Mirsoleimani"

From Chessprogramming wiki
Jump to: navigation, search
 
Line 22: Line 22:
 
* [[S. Ali Mirsoleimani]], [[Aske Plaat]], [[Jaap van den Herik]] ('''2015'''). ''Ensemble UCT Needs High Exploitation''. [http://arxiv.org/abs/1509.08434 arXiv:1509.08434]
 
* [[S. Ali Mirsoleimani]], [[Aske Plaat]], [[Jaap van den Herik]] ('''2015'''). ''Ensemble UCT Needs High Exploitation''. [http://arxiv.org/abs/1509.08434 arXiv:1509.08434]
 
* [[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'''). ''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'''). ''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]
 
* [[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]

Latest revision as of 22:31, 5 March 2019

Home * People * S. Ali Mirsoleimani

S. Ali Mirsoleimani [1]

Sayyed Ali Mirsoleimani,
an Iranian computer scientist and Ph.D. candidate at the Leiden Centre of Data Science [2], Leiden University and Nikhef, Amsterdam Science Park. He holds a M.Sc. degree in computer software engineering from Shiraz University, Shiraz in 2013, and a B.Sc. from Islamic Azad University in 2010. His research interests include machine learning, genetic and memetic algorithms, massive parallel high performance computing using GPU's and the Xeon Phi architecture. Involved in the HEPGAME project headed by Jos Vermaseren [3], he works on Monte-Carlo Tree Search, UCT, and parallel MCTS.

Selected Publications

[4] [5]

2012 ...

2015 ...

External Links

References

Up one level