The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Martin Müller 0003: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Akihiro Kishimoto, Martin Müller 0003
    A General Solution to the Graph History Interaction Problem. [Citation Graph (0, 0)][DBLP]
    AAAI, 2004, pp:644-649 [Conf]
  2. Akihiro Kishimoto, Martin Müller 0003
    Search versus Knowledge for Solving Life and Death Problems in Go. [Citation Graph (0, 0)][DBLP]
    AAAI, 2005, pp:1374-1379 [Conf]
  3. Martin Müller 0003, Markus Enzenberger, Jonathan Schaeffer
    Temperature Discovery Search. [Citation Graph (0, 0)][DBLP]
    AAAI, 2004, pp:658-663 [Conf]
  4. Xiaozhen Niu, Akihiro Kishimoto, Martin Müller 0003
    Recognizing Seki in Computer Go. [Citation Graph (0, 0)][DBLP]
    ACG, 2006, pp:88-103 [Conf]
  5. Ling Zhao, Martin Müller 0003
    Solving Probabilistic Combinatorial Games. [Citation Graph (0, 0)][DBLP]
    ACG, 2006, pp:225-238 [Conf]
  6. Akihiro Kishimoto, Martin Müller 0003
    DF-PN in Go: An Application to the One-Eye Problem. [Citation Graph (0, 0)][DBLP]
    ACG, 2003, pp:125-142 [Conf]
  7. Adi Botea, Martin Müller 0003, Jonathan Schaeffer
    Learning Partial-Order Macros from Solutions. [Citation Graph (0, 0)][DBLP]
    ICAPS, 2005, pp:231-240 [Conf]
  8. Adi Botea, Martin Müller 0003, Jonathan Schaeffer
    Using Component Abstraction for Automatic Generation of Macro-Actions. [Citation Graph (0, 0)][DBLP]
    ICAPS, 2004, pp:181-190 [Conf]
  9. Xiaozhen Niu, Martin Müller 0003
    An Improved Safety Solver for Computer Go. [Citation Graph (0, 0)][DBLP]
    Computers and Games, 2004, pp:97-112 [Conf]
  10. Martin Müller 0003
    Proof-Set Search. [Citation Graph (0, 0)][DBLP]
    Computers and Games, 2002, pp:88-107 [Conf]
  11. Adi Botea, Martin Müller 0003, Jonathan Schaeffer
    Using Abstraction for Planning in Sokoban. [Citation Graph (0, 0)][DBLP]
    Computers and Games, 2002, pp:360-375 [Conf]
  12. Martin Müller 0003
    Computer Go: A Research Agenda. [Citation Graph (0, 0)][DBLP]
    Computers and Games, 1998, pp:252-264 [Conf]
  13. Martin Müller 0003, Zhichao Li
    Locally Informed Global Search for Sums of Combinatorial Games. [Citation Graph (0, 0)][DBLP]
    Computers and Games, 2004, pp:273-284 [Conf]
  14. Martin Müller 0003
    Review: Computer Go 1984-2000. [Citation Graph (0, 0)][DBLP]
    Computers and Games, 2000, pp:405-413 [Conf]
  15. Anders Kierulf, Ralph Gasser, Peter M. Geiser, Martin Müller 0003, Jürg Nievergelt, Christoph Wirth
    Every Interactive System Evolves into Hyperspace: The Case of the Smart Game Board. [Citation Graph (0, 0)][DBLP]
    Hypertext/Hypermedia, 1991, pp:174-180 [Conf]
  16. Martin Müller 0003
    Decomposition Search: A Combinatorial Games Approach to Game Tree Search, with Applications to Solving Go Endgames. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1999, pp:578-583 [Conf]
  17. Jonathan Schaeffer, Yngvi Björnsson, Neil Burch, Akihiro Kishimoto, Martin Müller 0003, Robert Lake, Paul Lu, Steve Sutphen
    Solving Checkers. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2005, pp:292-297 [Conf]
  18. David Silver, Richard S. Sutton, Martin Müller 0003
    Reinforcement Learning of Local Shape in the Game of Go. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2007, pp:1053-1058 [Conf]
  19. Kazuki Yoshizoe, Akihiro Kishimoto, Martin Müller 0003
    Lambda Depth-First Proof Number Search and Its Application to Go. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2007, pp:2404-2409 [Conf]
  20. Adi Botea, Martin Müller 0003, Jonathan Schaeffer
    Fast Planning with Iterative Macros. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2007, pp:1828-1833 [Conf]
  21. Martin Müller 0003
    A Generalized Framework for Analyzing Capturing Races in Go. [Citation Graph (0, 0)][DBLP]
    JCIS, 2002, pp:469-472 [Conf]
  22. Ling Zhao, Martin Müller 0003
    Game-SAT: A Preliminary Report. [Citation Graph (0, 0)][DBLP]
    SAT, 2004, pp:- [Conf]
  23. Akihiro Kishimoto, Martin Müller 0003
    Dynamic Decomposition Search: A Divide and Conquer Approach and its Application to the One-Eye Problem in Go. [Citation Graph (0, 0)][DBLP]
    CIG, 2005, pp:- [Conf]
  24. Martin Müller 0003
    Partial order bounding: A new approach to evaluation in game tree search. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2001, v:129, n:1-2, pp:279-311 [Journal]
  25. Martin Müller 0003
    Computer Go. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2002, v:134, n:1-2, pp:145-179 [Journal]
  26. Jianjun Zhou, Martin Müller 0003
    Solving Systems of Difference Constraints Incrementally with Bidirectional Search. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2004, v:39, n:3, pp:255-274 [Journal]
  27. Jianjun Zhou, Martin Müller 0003
    Depth-First Discovery Algorithm for incremental topological sorting of directed acyclic graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:88, n:4, pp:195-200 [Journal]
  28. Akihiro Kishimoto, Martin Müller 0003
    A solution to the GHI problem for depth-first proof-number search. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 2005, v:175, n:4, pp:296-314 [Journal]
  29. Martin Müller 0003
    Global and local game tree search. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 2001, v:135, n:3-4, pp:187-206 [Journal]
  30. Martin Müller 0003
    Conditional combinatorial games and their application to analyzing capturing races in Go. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 2003, v:154, n:3-4, pp:189-202 [Journal]
  31. Xiaozhen Niu, Martin Müller 0003
    An Open Boundary Safety-of-Territory Solver for the Game of Go. [Citation Graph (0, 0)][DBLP]
    Computers and Games, 2006, pp:37-49 [Conf]
  32. Adi Botea, Markus Enzenberger, Martin Müller 0003, Jonathan Schaeffer
    Macro-FF: Improving AI Planning with Automatically Learned Macro-Operators. [Citation Graph (0, 0)][DBLP]
    J. Artif. Intell. Res. (JAIR), 2005, v:24, n:, pp:581-621 [Journal]

  33. A Lock-Free Multithreaded Monte-Carlo Tree Search Algorithm. [Citation Graph (, )][DBLP]


  34. Action Elimination and Plan Neighborhood Graph Search: Two Algorithms for Plan Improvement. [Citation Graph (, )][DBLP]


  35. An Improved Safety Solver in Go Using Partial Regions. [Citation Graph (, )][DBLP]


  36. About the Completeness of Depth-First Proof-Number Search. [Citation Graph (, )][DBLP]


  37. Using Artificial Boundaries in the Game of Go. [Citation Graph (, )][DBLP]


  38. Automating Layouts of Sewers in Subdivisions. [Citation Graph (, )][DBLP]


  39. Sample-based learning and search with permanent and transient memories. [Citation Graph (, )][DBLP]


  40. Monte-Carlo Exploration for Deterministic Planning. [Citation Graph (, )][DBLP]


Search in 0.048secs, Finished in 0.050secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002