Seguir
Martin Müller
Martin Müller
Professor, Computing Science, University of Alberta
Dirección de correo verificada de ualberta.ca - Página principal
Título
Citado por
Citado por
Año
Near optimal hierarchical path-finding.
A Botea, M Müller, J Schaeffer
J. Game Dev. 1 (1), 1-30, 2004
6242004
Checkers is solved
J Schaeffer, N Burch, Y Björnsson, A Kishimoto, M Müller, R Lake, P Lu, ...
Science 317 (5844), 1518, 2007
6042007
Computer Go
M Müller
Artificial Intelligence 134 (1-2), 145-179, 2002
2962002
Macro-FF: Improving AI planning with automatically learned macro-operators
A Botea, M Enzenberger, M Müller, J Schaeffer
Journal of Artificial Intelligence Research 24 (1), 581-621, 2005
2632005
Fuego - An Open-Source Framework for Board Games and Go Engine Based on Monte-Carlo Tree Search
M Enzenberger, M Müller, B Arneson, R Segal
Computational Intelligence and AI in Games, IEEE Transactions on, 1-1, 2009
2312009
Reinforcement learning of local shape in the game of Go
D Silver, R Sutton, M Müller
20th International Joint Conference on Artificial Intelligence, 1053-1058, 2007
1732007
Sample-based learning and search with permanent and transient memories
D Silver, RS Sutton, M Müller
Proceedings of the 25th international conference on Machine learning, 968-975, 2008
1622008
Temporal-difference search in computer Go
D Silver, RS Sutton, M Müller
Machine learning 87, 183-219, 2012
1372012
Monte-Carlo exploration for deterministic planning
H Nakhost, M Müller
Proc. IJCAI, 1766-1771, 2009
1302009
Solving checkers
J Schaeffer, Y Björnsson, N Burch, A Kishimoto, M Müller, R Lake, P Lu, ...
IJCAI, 292-297, 2005
842005
A lock-free multithreaded Monte-Carlo tree search algorithm
M Enzenberger, M Müller
Advances in Computer Games: 12th International Conference, ACG 2009 …, 2010
822010
Computer Go as a sum of local games
M Müller
Ph. D. Dissertation, ETH Zürich, 1995
80*1995
MoHex 2.0: a pattern-based MCTS Hex player
SC Huang, B Arneson, RB Hayward, M Müller, J Pawlewicz
652013
Resource-Constrained Planning: A Monte Carlo Random Walk Approach
H Nakhost, J Hoffmann, M Müller
ICAPS, 2012
622012
Using abstraction for planning in sokoban
A Botea, M Müller, J Schaeffer
Computers and Games: Third International Conference, CG 2002, Edmonton …, 2003
612003
Action elimination and plan neighborhood graph search: Two algorithms for plan improvement
H Nakhost, M Müller
Proc. ICAPS-2010, 121-128, 2010
592010
Learning partial-order macros from solutions
A Botea, M Müller, J Schaeffer
Proceedings of the 15th International Conference on Automated Planning and …, 2005
552005
Game-tree search using proof numbers: The first twenty years
A Kishimoto, MHM Winands, M Müller, JT Saito
Icga Journal 35 (3), 131-156, 2012
542012
A general solution to the graph history interaction problem
A Kishimoto, M Müller
PROCEEDINGS OF THE NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE, 644-649, 2004
502004
Df-pn in Go: Application to the one-eye problem
A Kishimoto, M Müller
Advances in computer games 10, 125-141, 2003
502003
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20