University of Alberta, Canada
List of publications from the DBLP Bibliography Server - FAQother persons with the same name:
2008 | ||
---|---|---|
37 | EE | Xiaozhen Niu, Martin Müller: An Improved Safety Solver in Go Using Partial Regions. Computers and Games 2008: 102-112 |
36 | EE | Akihiro Kishimoto, Martin Müller: About the Completeness of Depth-First Proof-Number Search. Computers and Games 2008: 146-156 |
35 | EE | Ling Zhao, Martin Müller: Using Artificial Boundaries in the Game of Go. Computers and Games 2008: 81-91 |
34 | EE | David Silver, Richard S. Sutton, Martin Müller: Sample-based learning and search with permanent and transient memories. ICML 2008: 968-975 |
2007 | ||
33 | EE | David Silver, Richard S. Sutton, Martin Müller: Reinforcement Learning of Local Shape in the Game of Go. IJCAI 2007: 1053-1058 |
32 | EE | Adi Botea, Martin Müller, Jonathan Schaeffer: Fast Planning with Iterative Macros. IJCAI 2007: 1828-1833 |
31 | EE | Kazuki Yoshizoe, Akihiro Kishimoto, Martin Müller: Lambda Depth-First Proof Number Search and Its Application to Go. IJCAI 2007: 2404-2409 |
2006 | ||
30 | EE | Ling Zhao, Martin Müller: Solving Probabilistic Combinatorial Games. ACG 2006: 225-238 |
29 | EE | Xiaozhen Niu, Akihiro Kishimoto, Martin Müller: Recognizing Seki in Computer Go. ACG 2006: 88-103 |
28 | EE | Xiaozhen Niu, Martin Müller: An Open Boundary Safety-of-Territory Solver for the Game of Go. Computers and Games 2006: 37-49 |
2005 | ||
27 | Akihiro Kishimoto, Martin Müller: Search versus Knowledge for Solving Life and Death Problems in Go. AAAI 2005: 1374-1379 | |
26 | EE | 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 |
25 | Adi Botea, Martin Müller, Jonathan Schaeffer: Learning Partial-Order Macros from Solutions. ICAPS 2005: 231-240 | |
24 | EE | Jonathan Schaeffer, Yngvi Björnsson, Neil Burch, Akihiro Kishimoto, Martin Müller, Robert Lake, Paul Lu, Steve Sutphen: Solving Checkers. IJCAI 2005: 292-297 |
23 | EE | Akihiro Kishimoto, Martin Müller: A solution to the GHI problem for depth-first proof-number search. Inf. Sci. 175(4): 296-314 (2005) |
22 | EE | 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) |
2004 | ||
21 | Akihiro Kishimoto, Martin Müller: A General Solution to the Graph History Interaction Problem. AAAI 2004: 644-649 | |
20 | Martin Müller, Markus Enzenberger, Jonathan Schaeffer: Temperature Discovery Search. AAAI 2004: 658-663 | |
19 | EE | Martin Müller, Zhichao Li: Locally Informed Global Search for Sums of Combinatorial Games. Computers and Games 2004: 273-284 |
18 | EE | Xiaozhen Niu, Martin Müller: An Improved Safety Solver for Computer Go. Computers and Games 2004: 97-112 |
17 | Adi Botea, Martin Müller, Jonathan Schaeffer: Using Component Abstraction for Automatic Generation of Macro-Actions. ICAPS 2004: 181-190 | |
16 | EE | Ling Zhao, Martin Müller: Game-SAT: A Preliminary Report. SAT 2004 |
15 | EE | Jianjun Zhou, Martin Müller: Solving Systems of Difference Constraints Incrementally with Bidirectional Search. Algorithmica 39(3): 255-274 (2004) |
2003 | ||
14 | Jonathan Schaeffer, Martin Müller, Yngvi Björnsson: Computers and Games, Third International Conference, CG 2002, Edmonton, Canada, July 25-27, 2002, Revised Papers Springer 2003 | |
13 | Akihiro Kishimoto, Martin Müller: DF-PN in Go: An Application to the One-Eye Problem. ACG 2003: 125-142 | |
12 | EE | 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) |
11 | EE | Martin Müller: Conditional combinatorial games and their application to analyzing capturing races in Go. Inf. Sci. 154(3-4): 189-202 (2003) |
2002 | ||
10 | EE | Adi Botea, Martin Müller, Jonathan Schaeffer: Using Abstraction for Planning in Sokoban. Computers and Games 2002: 360-375 |
9 | EE | Martin Müller: Proof-Set Search. Computers and Games 2002: 88-107 |
8 | Martin Müller: A Generalized Framework for Analyzing Capturing Races in Go. JCIS 2002: 469-472 | |
7 | EE | Martin Müller: Computer Go. Artif. Intell. 134(1-2): 145-179 (2002) |
2001 | ||
6 | EE | Martin Müller: Partial order bounding: A new approach to evaluation in game tree search. Artif. Intell. 129(1-2): 279-311 (2001) |
5 | Martin Müller: Global and local game tree search. Inf. Sci. 135(3-4): 187-206 (2001) | |
2000 | ||
4 | EE | Martin Müller: Review: Computer Go 1984-2000. Computers and Games 2000: 405-413 |
1999 | ||
3 | Martin Müller: Decomposition Search: A Combinatorial Games Approach to Game Tree Search, with Applications to Solving Go Endgames. IJCAI 1999: 578-583 | |
1998 | ||
2 | EE | Martin Müller: Computer Go: A Research Agenda. Computers and Games 1998: 252-264 |
1991 | ||
1 | 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 |
1 | Yngvi Björnsson | [14] [24] |
2 | Adi Botea | [10] [17] [22] [25] [32] |
3 | Neil Burch | [24] |
4 | Markus Enzenberger | [20] [22] |
5 | Ralph Gasser | [1] |
6 | Peter M. Geiser | [1] |
7 | Anders Kierulf | [1] |
8 | Akihiro Kishimoto | [13] [21] [23] [24] [26] [27] [29] [31] [36] |
9 | Robert Lake | [24] |
10 | Zhichao Li | [19] |
11 | Paul Lu | [24] |
12 | Jürg Nievergelt | [1] |
13 | Xiaozhen Niu | [18] [28] [29] [37] |
14 | Jonathan Schaeffer | [10] [14] [17] [20] [22] [24] [25] [32] |
15 | David Silver | [33] [34] |
16 | Steve Sutphen | [24] |
17 | Richard S. Sutton | [33] [34] |
18 | Christoph Wirth | [1] |
19 | Kazuki Yoshizoe | [31] |
20 | Ling Zhao | [16] [30] [35] |
21 | Jianjun Zhou | [12] [15] |