| 2007 |
|---|
| 24 | | Michael Buro,
Alexander Kovarsky:
Concurrent Action Execution with Shared Fluents.
AAAI 2007: 950-955 |
| 23 | | M. Renee Jansen,
Michael Buro:
HPA* Enhancements.
AIIDE 2007: 84-87 |
| 2006 |
|---|
| 22 | | Douglas Demyen,
Michael Buro:
Efficient Triangulation-Based Pathfinding.
AAAI 2006 |
| 21 | | Nathan R. Sturtevant,
Michael Buro:
Improving Collaborative Pathfinding Using Map Abstraction.
AIIDE 2006: 80-85 |
| 2005 |
|---|
| 20 | | Nathan R. Sturtevant,
Michael Buro:
Partial Pathfinding Using Map Abstraction and Refinement.
AAAI 2005: 1392-1397 |
| 19 | EE | Michael Chung,
Michael Buro,
Jonathan Schaeffer:
Monte Carlo Planning in RTS Games.
CIG 2005 |
| 18 | EE | Alexander Kovarsky,
Michael Buro:
Heuristic Search Applied to Abstract Combat Games.
Canadian Conference on AI 2005: 66-78 |
| 17 | EE | Timothy Furtak,
Masashi Kiyomi,
Takeaki Uno,
Michael Buro:
Generalized Amazons is PSPACE-Complete.
IJCAI 2005: 132-137 |
| 16 | EE | Nathan R. Sturtevant,
Vadim Bulitko,
Michael Buro:
Automatic State Abstraction for Pathfinding in Real-Time Video Games.
SARA 2005: 362-364 |
| 15 | EE | Dave Gomboc,
Michael Buro,
T. Anthony Marsland:
Tuning evaluation functions by maximizing concordance.
Theor. Comput. Sci. 349(2): 202-229 (2005) |
| 2004 |
|---|
| 14 | EE | Thomas Hauk,
Michael Buro,
Jonathan Schaeffer:
Rediscovering *-Minimax Search.
Computers and Games 2004: 35-50 |
| 13 | EE | Thomas Hauk,
Michael Buro,
Jonathan Schaeffer:
*-Minimax Performance in Backgammon.
Computers and Games 2004: 51-66 |
| 2003 |
|---|
| 12 | | Dave Gomboc,
T. Anthony Marsland,
Michael Buro:
Evaluation Function Tuning via Ordinal Correlation.
ACG 2003: 1-18 |
| 11 | | Albert Xin Jiang,
Michael Buro:
First Experimental Results of ProbCut Applied to Chess.
ACG 2003: 19-32 |
| 10 | | Michael Buro:
Solving the Oshi-Zumo Game.
ACG 2003: 361-366 |
| 9 | | Michael Buro:
Real-Time Strategy Games: A New AI Research Challenge.
IJCAI 2003: 1534-1535 |
| 2002 |
|---|
| 8 | EE | Michael Buro:
ORTS: A Hack-Free RTS Game Environment.
Computers and Games 2002: 280-291 |
| 7 | | Michael Buro:
The evolution of strong othello programs.
IWEC 2002: 81-88 |
| 6 | EE | Michael Buro:
Improving heuristic mini-max search by supervised learning.
Artif. Intell. 134(1-2): 85-99 (2002) |
| 2000 |
|---|
| 5 | EE | Michael Buro:
Simple Amazons Endgames and Their Connection to Hamilton Circuits in Cubic Subgrid Graphs.
Computers and Games 2000: 250-261 |
| 1998 |
|---|
| 4 | EE | Michael Buro:
From Simple Features to Sophisticated Evaluation Functions.
Computers and Games 1998: 126-145 |
| 1996 |
|---|
| 3 | | Michael Buro,
Hans Kleine Büning:
On Resolution with Short Clauses.
Ann. Math. Artif. Intell. 18(2-4): 243-260 (1996) |
| 1995 |
|---|
| 2 | | Michael Buro:
Statistical Feature Combination for the Evaluation of Game Positions.
J. Artif. Intell. Res. (JAIR) 3: 373-382 (1995) |
| 1993 |
|---|
| 1 | | Michael Buro:
On the Maximum Length of Huffman Codes.
Inf. Process. Lett. 45(5): 219-223 (1993) |
