Martin Müller

发表

A General Solution to the Graph History Interaction Problem

Akihiro Kishimoto, Martin Müller, Martin Müller, 2004, AAAI.

Partial order bounding: A new approach to evaluation in game tree search

Martin Müller, Martin Müller, 2001, Artif. Intell..

A Study of UCT and Its Enhancements in an Artificial Game

Martin Müller, David Tom, 2009, ACG.

Computer Go

Martin Müller, Martin Müller, 2002, Artif. Intell..

Structured Best Arm Identification with Fixed Confidence

Csaba Szepesvári, Martin Müller, Ruitong Huang, 2017, ALT.

Is There a Right Research Design for Your Supply Chain Study

Martin Müller, Gerald Reiner, Stefan Seuring, 2005 .

Focused Depth-first Proof Number Search using Convolutional Neural Networks for the Game of Hex

Chao Gao, Ryan B. Hayward, Martin Müller, 2017, IJCAI.

Editorial Introduction to Issue 9 of the Journal of the Text Encoding Initiative

Martin Müller, 2016 .

Solving Probabilistic Combinatorial Games

Martin Müller, Ling Zhao, Martin Müller, 2006, ACG.

Action Elimination and Plan Neighborhood Graph Search: Two Algorithms for Plan Improvement

Martin Müller, Hootan Nakhost, 2010, ICAPS.

Solving Systems of Difference Constraints Incrementally with Bidirectional Search

Martin Müller, Jianjun Zhou, Martin Müller, 2004, Algorithmica.

Macro-FF: Improving AI Planning with Automatically Learned Macro-Operators

Jonathan Schaeffer, Adi Botea, Martin Müller, 2005, J. Artif. Intell. Res..

Factorization Ranking Model for Move Prediction in the Game of Go

Martin Müller, Chenjun Xiao, 2016, AAAI.

MoHex 2.0: A Pattern-Based MCTS Hex Player

Shih-Chieh Huang, Jakub Pawlewicz, Ryan B. Hayward, 2013, Computers and Games.

Fuego-GB Prototype at the Human machine competition in Barcelona 2010: a Tournament Report and Analysis

Martin Müller, 2010 .

TDS+: Improving Temperature Discovery Search

Martin Müller, Yeqin Zhang, 2015, AAAI.

The Two-Edged Nature of Diverse Action Costs

Robert C. Holte, Martin Müller, Gaojian Fan, 2017, ICAPS.

Towards a Second Generation Random Walk Planner: An Experimental Exploration

Martin Müller, Hootan Nakhost, Martin Müller, 2013, IJCAI.

Additive Merge-and-Shrink Heuristics for Diverse Action Costs

Robert C. Holte, Martin Müller, Gaojian Fan, 2017, IJCAI.

Reinforcement Learning of Local Shape in the Game of Go

Richard S. Sutton, David Silver, Martin Müller, 2007, IJCAI.

An Open Boundary Safety-of-Territory Solver for the Game of Go

Martin Müller, Xiaozhen Niu, 2006, Computers and Games.

Guest Editorial Special Issue on Deep/Reinforcement Learning and Games

I-Chen Wu, Chang-Shing Lee, Martin Müller, 2018, IEEE Trans. Games.

Planning Via Random Walk-Driven Local Search

Martin Müller, Fan Xie, Hootan Nakhost, 2012, ICAPS.

Lambda Depth-First Proof Number Search and Its Application to Go

Akihiro Kishimoto, Martin Müller, Kazuki Yoshizoe, 2007, IJCAI.

MS-Lite: A Lightweight, Complementary Merge-and-Shrink Method

Robert C. Holte, Martin Müller, Gaojian Fan, 2018, ICAPS.

An Improved Safety Solver for Computer Go

Martin Müller, Xiaozhen Niu, 2004, Computers and Games.

Temperature Discovery Search

Jonathan Schaeffer, Martin Müller, Markus Enzenberger, 2004, AAAI.

Better Time Constrained Search via Randomization and Postprocessing

Richard Anthony Valenzano, Martin Müller, Fan Xie, 2013, ICAPS.

Solving Checkers

Jonathan Schaeffer, Akihiro Kishimoto, Steve Sutphen, 2005, IJCAI.

Position Evaluation in Computer Go

Martin Müller, 2002, J. Int. Comput. Games Assoc..

Non-Linear Merging Strategies for Merge-and-Shrink Based on Variable Interactions

Robert C. Holte, Martin Müller, Gaojian Fan, 2014, SOCS.

Type-Based Exploration with Multiple Search Queues for Satisficing Planning

Robert C. Holte, Martin Müller, Fan Xie, 2014, AAAI.

Computational Experiments with the RAVE Heuristic

Martin Müller, David Tom, 2010, Computers and Games.

Depth-First Discovery Algorithm for incremental topological sorting of directed acyclic graphs

Martin Müller, Jianjun Zhou, 2003, Inf. Process. Lett..

Global and local game tree search

Martin Müller, 2001, Inf. Sci..

Dynamic Decomposition Search: A Divide and Conquer Approach and its Application to the One-Eye Problem in Go

Akihiro Kishimoto, Martin Müller, 2005, CIG.

DF-PN in Go: An Application to the One-Eye Problem

Akihiro Kishimoto, Martin Müller, Martin Müller, 2003, ACG.

A Generalized Framework for Analyzing Capturing Races in Go

Martin Müller, 2002, JCIS.

Computer Go

Martin Müller, Kazuki Yoshizoe, 2019, Encyclopedia of Computer Graphics and Games.

Recognizing Seki in Computer Go

Akihiro Kishimoto, Martin Müller, Xiaozhen Niu, 2006, ACG.

A transferable neural network for Hex

Chao Gao, Ryan B. Hayward, Martin Müller, 2018, J. Int. Comput. Games Assoc..

ArvandHerd: Parallel Planning with a Portfolio

Nathan R. Sturtevant, Jonathan Schaeffer, Richard Anthony Valenzano, 2012, ECAI.

Fast Planning with Iterative Macros

Jonathan Schaeffer, Adi Botea, Martin Müller, 2007, IJCAI.

Review: Computer Go 1984-2000

Martin Müller, 2000, Computers and Games.

Adding Local Exploration to Greedy Best-First Search in Satisficing Planning

Robert C. Holte, Martin Müller, Fan Xie, 2014, AAAI.

Report on the second Open Computer-Amazons Championship

Hiroyuki Iida, Martin Müller, H. Iida, 2000, J. Int. Comput. Games Assoc..

An Enhanced Solver for the Game of Amazons

Jiaxing Song, Martin Müller, 2015, IEEE Transactions on Computational Intelligence and AI in Games.

Search versus Knowledge for Solving Life and Death Problems in Go

Akihiro Kishimoto, Martin Müller, 2005, AAAI.

Conditional combinatorial games and their application to analyzing capturing races in Go

Martin Müller, 2003, Inf. Sci..

The Design and Evolution of Go Explorer

Jürg Nievergelt, Martin Müller, Anders Kierulf, 1990 .

Adversarial Policy Gradient for Alternating Markov Games

Chao Gao, Ryan B. Hayward, Martin Müller, 2018, ICLR.

Investigating the Limits of Monte-Carlo Tree Search Methods in Computer Go

Shih-Chieh Huang, Martin Müller, 2013, Computers and Games.

Resource-Constrained Planning: A Monte Carlo Random Walk Approach

Jörg Hoffmann, Martin Müller, Hootan Nakhost, 2012, ICAPS.

Sample-based learning and search with permanent and transient memories

Richard S. Sutton, David Silver, Martin Müller, 2008, ICML '08.

Decomposition Search: A Combinatorial Games Approach to Game Tree Search, with Applications to Solving Go Endgames

Martin Müller, 1999, IJCAI.

About the Completeness of Depth-First Proof-Number Search

Akihiro Kishimoto, Martin Müller, Martin Müller, 2008, Computers and Games.

A Lock-Free Multithreaded Monte-Carlo Tree Search Algorithm

Martin Müller, Markus Enzenberger, 2009, ACG.

Improving Local Search for Resource-Constrained Planning

Jörg Hoffmann, Martin Müller, Hootan Nakhost, 2010, SOCS.

Game-Tree Search Using Proof Numbers: The First Twenty Years

Akihiro Kishimoto, Mark H. M. Winands, Martin Müller, 2012, J. Int. Comput. Games Assoc..

Analyzing Simulations in Monte-Carlo Tree Search for the Game of Go

Martin Müller, Sumudu Fernando, 2013, Computers and Games.

Automatically Configuring Algorithms for Scaling Performance

Holger H. Hoos, Martin Müller, James Styles, 2012, LION.

Characterization of Glue Variables in CDCL SAT Solving pdf

Jia-Huai You, Martin Müller, Md. Solimul Chowdhury, 2019, ArXiv.

Memory-Augmented Monte Carlo Tree Search

Martin Müller, Chenjun Xiao, Jincheng Mei, 2018, AAAI.

Special Issue on Monte Carlo Techniques and Computer Go

Olivier Teytaud, Chang-Shing Lee, Martin Müller, 2010, IEEE Trans. Comput. Intell. AI Games.

Three-Head Neural Network Architecture for Monte Carlo Tree Search

Chao Gao, Ryan B. Hayward, Martin Müller, 2018, IJCAI.

Fuegito: an Educational Software Package for Game Tree Search

Martin Müller, Colin Hunt, 2013 .

Using Artificial Boundaries in the Game of Go

Martin Müller, Ling Zhao, 2008, Computers and Games.

Using Component Abstraction for Automatic Generation of Macro-Actions

Jonathan Schaeffer, Adi Botea, Martin Müller, 2004, ICAPS.

Preliminary Results on Exploration-Driven Satisfiability Solving

Jia-Huai You, Martin Müller, Md. Solimul Chowdhury, 2018, AAAI.

Blunder Cost in Go and Hex

Ryan B. Hayward, Martin Müller, David Spies, 2011, ACG.

Monte-Carlo Exploration for Deterministic Planning

Martin Müller, Hootan Nakhost, Martin Müller, 2009, IJCAI.

Revisiting Move Groups in Monte-Carlo Tree Search

Martin Müller, Gabriel Van Eyck, Martin Müller, 2011, ACG.

A Theoretical Framework for Studying Random Walk Planning

Martin Müller, Hootan Nakhost, 2012, SOCS.

Towards a theory of random walk planning: Regress factors, fair homogeneous graphs and extensions

Martin Müller, Hootan Nakhost, 2014, AI Commun..

Open Access and Open Data at CGIAR: Challenges and Solutions

Martin Müller, Elizabeth Arnaud, Medha Devare, 2017 .

Understanding and Improving Local Exploration for GBFS

Robert C. Holte, Martin Müller, Fan Xie, 2015, ICAPS.

Using Abstraction for Planning in Sokoban

Jonathan Schaeffer, Adi Botea, Martin Müller, 2002, Computers and Games.

Learning Partial-Order Macros from Solutions

Jonathan Schaeffer, Adi Botea, Martin Müller, 2005, ICAPS.

A solution to the GHI problem for depth-first proof-number search

Akihiro Kishimoto, Martin Müller, Martin Müller, 2005, Inf. Sci..

A Local Monte Carlo Tree Search Approach in Deterministic Planning

Martin Müller, Fan Xie, Hootan Nakhost, 2011, AAAI.

Computer Go: A Research Agenda

Martin Müller, 1998, Computers and Games.

Keynote speech III: Computer go research - The challenges ahead

Martin Müller, 2015, CIG.

Game-SAT: A Preliminary Report

Martin Müller, Ling Zhao, 2004, SAT.

Every Interactive System Evolves into Hyperspace: The Case of the Smart Game Board

Ralph Gasser, Jürg Nievergelt, Martin Müller, 1991, Hypertext/Hypermedia.

Proof-Set Search

Martin Müller, 2002, Computers and Games.

Fuego—An Open-Source Framework for Board Games and Go Engine Based on Monte Carlo Tree Search

Martin Müller, Markus Enzenberger, Broderick Arneson, 2010, IEEE Transactions on Computational Intelligence and AI in Games.

Locally Informed Global Search for Sums of Combinatorial Games

Zhichao Li, Martin Müller, 2004, Computers and Games.

Predicting Human Card Selection in Magic: The Gathering with Contextual Preference Ranking

Johannes Fürnkranz, Martin Müller, Timo Bertram, 2021, 2021 IEEE Conference on Games (CoG).

A Deep Dive into Conflict Generating Decisions pdf

Martin Müller, Md. Solimul Chowdhury, Md Solimul Chowdhury, 2021, ArXiv.

Arvand : the Art of Random Walks

Martin Müller, Fan Xie, Hootan Nakhost, 2011 .

Depth-first discovery algorithm for incremental topological sorting of directed acyclic graphs

Martin Müller, Jianjun Zhou, 2003 .

March 2004 7 NEAR OPTIMAL HIERARCHICAL PATHFINDING

Jonathan Schaeffer, Adi Botea, Martin Müller, 2004 .

ArvandHerd 2014

Nathan R. Sturtevant, Jonathan Schaeffer, Martin Müller, 2014 .