Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Martin Müller 0003
Author information
- University of Alberta, Canada
Other persons with the same name
2010 – today
- 2012
[j12]David Silver, Richard S. Sutton, Martin Müller: Temporal-difference search in computer Go. Machine Learning 87(2): 183-219 (2012)- [c43]Hootan Nakhost, Jörg Hoffmann, Martin Müller: Resource-Constrained Planning: A Monte Carlo Random Walk Approach. ICAPS 2012
- [c42]
- [c41]Richard Anthony Valenzano, Hootan Nakhost, Martin Müller, Jonathan Schaeffer, Nathan R. Sturtevant: ArvandHerd: Parallel Planning with a Portfolio. ECAI 2012: 786-791
- [c40]James Styles, Holger H. Hoos, Martin Müller: Automatically Configuring Algorithms for Scaling Performance. LION 2012: 205-219
- [c39]
- 2011
- [c38]Fan Xie, Hootan Nakhost, Martin Müller: A Local Monte Carlo Tree Search Approach in Deterministic Planning. AAAI 2011
- [c37]
- [c36]Henry Brausen, Ryan B. Hayward, Martin Müller, Abdul Qadir, David Spies: Blunder Cost in Go and Hex. ACG 2011: 220-229
- [i1]Adi Botea, Markus Enzenberger, Martin Müller, Jonathan Schaeffer: Macro-FF: Improving AI Planning with Automatically Learned Macro-Operators. CoRR abs/1109.2154 (2011)
- 2010
- [j11]Chang-Shing Lee, Martin Müller, Olivier Teytaud: Special Issue on Monte Carlo Techniques and Computer Go. IEEE Trans. Comput. Intellig. and AI in Games 2(4): 225-228 (2010)
- [j10]Markus Enzenberger, Martin Müller, B. Arneson, R. Segal: Fuego - An Open-Source Framework for Board Games and Go Engine Based on Monte Carlo Tree Search. IEEE Trans. Comput. Intellig. and AI in Games 2(4): 259-270 (2010)
- [c35]Hootan Nakhost, Martin Müller: Action Elimination and Plan Neighborhood Graph Search: Two Algorithms for Plan Improvement. ICAPS 2010: 121-128
- [c34]David Tom, Martin Müller: Computational Experiments with the RAVE Heuristic. Computers and Games 2010: 69-80
- [c33]Neil Burch, Robert C. Holte, Martin Müller, David O'Connell, Jonathan Schaeffer: Automating Layouts of Sewers in Subdivisions. ECAI 2010: 655-660
- [c32]Hootan Nakhost, Jörg Hoffmann, Martin Müller: Improving Local Search for Resource-Constrained Planning. SOCS 2010
2000 – 2009
- 2009
- [c31]Markus Enzenberger, Martin Müller: A Lock-Free Multithreaded Monte-Carlo Tree Search Algorithm. ACG 2009: 14-20
- [c30]
- [c29]Hootan Nakhost, Martin Müller: Monte-Carlo Exploration for Deterministic Planning. IJCAI 2009: 1766-1771
- 2008
- [c28]Ling Zhao, Martin Müller: Using Artificial Boundaries in the Game of Go. Computers and Games 2008: 81-91
- [c27]Xiaozhen Niu, Martin Müller: An Improved Safety Solver in Go Using Partial Regions. Computers and Games 2008: 102-112
- [c26]Akihiro Kishimoto, Martin Müller: About the Completeness of Depth-First Proof-Number Search. Computers and Games 2008: 146-156
- [c25]David Silver, Richard S. Sutton, Martin Müller: Sample-based learning and search with permanent and transient memories. ICML 2008: 968-975
- 2007
- [c24]David Silver, Richard S. Sutton, Martin Müller: Reinforcement Learning of Local Shape in the Game of Go. IJCAI 2007: 1053-1058
- [c23]Adi Botea, Martin Müller, Jonathan Schaeffer: Fast Planning with Iterative Macros. IJCAI 2007: 1828-1833
- [c22]Kazuki Yoshizoe, Akihiro Kishimoto, Martin Müller: Lambda Depth-First Proof Number Search and Its Application to Go. IJCAI 2007: 2404-2409
- 2006
- [c21]
- [c20]
- [c19]Xiaozhen Niu, Martin Müller: An Open Boundary Safety-of-Territory Solver for the Game of Go. Computers and Games 2006: 37-49
- 2005
- [j9]Akihiro Kishimoto, Martin Müller: A solution to the GHI problem for depth-first proof-number search. Inf. Sci. 175(4): 296-314 (2005)
- [j8]Adi Botea, Markus Enzenberger, Martin Müller, Jonathan Schaeffer: Macro-FF: Improving AI Planning with Automatically Learned Macro-Operators. J. Artif. Intell. Res. (JAIR) 24: 581-621 (2005)
- [c18]Akihiro Kishimoto, Martin Müller: Search versus Knowledge for Solving Life and Death Problems in Go. AAAI 2005: 1374-1379
- [c17]Adi Botea, Martin Müller, Jonathan Schaeffer: Learning Partial-Order Macros from Solutions. ICAPS 2005: 231-240
- [c16]Akihiro Kishimoto, Martin Müller: Dynamic Decomposition Search: A Divide and Conquer Approach and its Application to the One-Eye Problem in Go. CIG 2005
- [c15]Jonathan Schaeffer, Yngvi Björnsson, Neil Burch, Akihiro Kishimoto, Martin Müller, Robert Lake, Paul Lu, Steve Sutphen: Solving Checkers. IJCAI 2005: 292-297
- 2004
- [j7]Jianjun Zhou, Martin Müller: Solving Systems of Difference Constraints Incrementally with Bidirectional Search. Algorithmica 39(3): 255-274 (2004)
- [c14]Akihiro Kishimoto, Martin Müller: A General Solution to the Graph History Interaction Problem. AAAI 2004: 644-649
- [c13]Martin Müller, Markus Enzenberger, Jonathan Schaeffer: Temperature Discovery Search. AAAI 2004: 658-663
- [c12]Adi Botea, Martin Müller, Jonathan Schaeffer: Using Component Abstraction for Automatic Generation of Macro-Actions. ICAPS 2004: 181-190
- [c11]Xiaozhen Niu, Martin Müller: An Improved Safety Solver for Computer Go. Computers and Games 2004: 97-112
- [c10]Martin Müller, Zhichao Li: Locally Informed Global Search for Sums of Combinatorial Games. Computers and Games 2004: 273-284
- [c9]
- 2003
- [j6]Jianjun Zhou, Martin Müller: Depth-First Discovery Algorithm for incremental topological sorting of directed acyclic graphs. Inf. Process. Lett. 88(4): 195-200 (2003)
- [j5]Martin Müller: Conditional combinatorial games and their application to analyzing capturing races in Go. Inf. Sci. 154(3-4): 189-202 (2003)
- [c8]Akihiro Kishimoto, Martin Müller: DF-PN in Go: An Application to the One-Eye Problem. ACG 2003: 125-142
- [e1]Jonathan Schaeffer, Martin Müller, Yngvi Björnsson (Eds.): Computers and Games, Third International Conference, CG 2002, Edmonton, Canada, July 25-27, 2002, Revised Papers. Lecture Notes in Computer Science 2883, Springer 2003, ISBN 3-540-20545-4
- 2002
- [j4]
- [j3]
- [c7]
- [c6]Adi Botea, Martin Müller, Jonathan Schaeffer: Using Abstraction for Planning in Sokoban. Computers and Games 2002: 360-375
- [c5]
- 2001
- [j2]Martin Müller: Partial order bounding: A new approach to evaluation in game tree search. Artif. Intell. 129(1-2): 279-311 (2001)
- [j1]
- 2000
- [c4]
1990 – 1999
- 1999
- [c3]Martin Müller: Decomposition Search: A Combinatorial Games Approach to Game Tree Search, with Applications to Solving Go Endgames. IJCAI 1999: 578-583
- 1998
- [c2]
- 1991
- [c1]Anders Kierulf, Ralph Gasser, Peter M. Geiser, Martin Müller, Jürg Nievergelt, Christoph Wirth: Every Interactive System Evolves into Hyperspace: The Case of the Smart Game Board. Hypertext/Hypermedia 1991: 174-180
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-02-27 20:33 CET by the dblp team