 | 2009 |
| 30 |  | Carsten Moldenhauer,
Nathan R. Sturtevant:
Optimal solutions for moving target search.
AAMAS (2) 2009: 1249-1250 |
| 29 |  | Barnabás Póczos,
Yasin Abbasi-Yadkori,
Csaba Szepesvári,
Russell Greiner,
Nathan R. Sturtevant:
Learning when to stop thinking and do something!
ICML 2009: 104 |
| 28 |  | Michael Buro,
Jeffrey R. Long,
Timothy Furtak,
Nathan R. Sturtevant:
Improving State Evaluation, Inference, and Search in Trick-Based Card Games.
IJCAI 2009: 1407-1413 |
| 27 |  | Yngvi Björnsson,
Vadim Bulitko,
Nathan R. Sturtevant:
TBA*: Time-Bounded A*.
IJCAI 2009: 431-436 |
| 26 |  | Carsten Moldenhauer,
Nathan R. Sturtevant:
Evaluating Strategies for Running from the Cops.
IJCAI 2009: 584-589 |
| 25 |  | Nathan R. Sturtevant,
Ariel Felner,
Max Barrer,
Jonathan Schaeffer,
Neil Burch:
Memory-Based Heuristics for Explicit State Spaces.
IJCAI 2009: 609-614 |
| 24 |  | Zhifu Zhang,
Nathan R. Sturtevant,
Robert C. Holte,
Jonathan Schaeffer,
Ariel Felner:
A* Search with Inconsistent Heuristics.
IJCAI 2009: 634-639 |
| 2008 |
| 23 |  | M. Renee Jansen,
Nathan R. Sturtevant:
A new approach to cooperative pathfinding.
AAMAS (3) 2008: 1401-1404 |
| 22 |  | Akihiro Kishimoto,
Nathan R. Sturtevant:
Optimized algorithms for multi-agent routing.
AAMAS (3) 2008: 1585-1588 |
| 21 |  | M. Renee Jansen,
Nathan R. Sturtevant:
Direction Maps for Cooperative Pathfinding.
AIIDE 2008 |
| 20 |  | Nathan R. Sturtevant:
An Analysis of UCT in Multi-player Games.
Computers and Games 2008: 37-49 |
| 19 |  | Nathan R. Sturtevant,
H. James Hoover,
Jonathan Schaeffer,
Sean Gouglas,
Michael H. Bowling,
Finnegan Southey,
Matthew Bouchard,
Ghassan Zabaneh:
Multidisciplinary students and instructors: a second-year games course.
SIGCSE 2008: 383-387 |
| 18 |  | Nathan R. Sturtevant:
An Analysis of UCT in Multi-Player Games.
ICGA Journal 31(4): 195-208 (2008) |
| 2007 |
| 17 |  | Uzi Zahavi,
Ariel Felner,
Jonathan Schaeffer,
Nathan R. Sturtevant:
Inconsistent Heuristics.
AAAI 2007: 1211-1216 |
| 16 |  | Nathan R. Sturtevant:
Memory-Efficient Abstractions for Pathfinding.
AIIDE 2007: 31-36 |
| 15 |  | Nathan R. Sturtevant,
M. Renee Jansen:
An Analysis of Map-Based Abstraction and Refinement.
SARA 2007: 344-358 |
| 14 |  | Vadim Bulitko,
Nathan R. Sturtevant,
Jieshan Lu,
Timothy Yau:
Graph Abstraction in Real-time Heuristic Search.
J. Artif. Intell. Res. (JAIR) 30: 51-100 (2007) |
| 2006 |
| 13 |  | Nathan R. Sturtevant,
Martin Zinkevich,
Michael H. Bowling:
Prob-Maxn: Playing N-Player Games with Opponent Models.
AAAI 2006 |
| 12 |  | Nathan R. Sturtevant,
Michael H. Bowling:
Robust game play against unknown opponents.
AAMAS 2006: 713-719 |
| 11 |  | Yngvi Björnsson,
Jonathan Schaeffer,
Nathan R. Sturtevant:
Partial Information Endgame Databases.
ACG 2006: 11-22 |
| 10 |  | Nathan R. Sturtevant,
Michael Buro:
Improving Collaborative Pathfinding Using Map Abstraction.
AIIDE 2006: 80-85 |
| 9 |  | Nathan R. Sturtevant,
Adam M. White:
Feature Construction for Reinforcement Learning in Hearts.
Computers and Games 2006: 122-134 |
| 2005 |
| 8 |  | Vadim Bulitko,
Nathan R. Sturtevant,
Maryia Kazakevich:
Speeding Up Learning in Real-time Search via Automatic State Abstraction.
AAAI 2005: 1349-1354 |
| 7 |  | Nathan R. Sturtevant,
Michael Buro:
Partial Pathfinding Using Map Abstraction and Refinement.
AAAI 2005: 1392-1397 |
| 6 |  | Nathan R. Sturtevant:
Leaf-Value Tables for Pruning Non-Zero-Sum Games.
IJCAI 2005: 317-323 |
| 5 |  | Nathan R. Sturtevant,
Vadim Bulitko,
Michael Buro:
Automatic State Abstraction for Pathfinding in Real-Time Video Games.
SARA 2005: 362-364 |
| 2004 |
| 4 |  | Nathan R. Sturtevant:
Current Challenges in Multi-player Game Search.
Computers and Games 2004: 285-300 |
| 2003 |
| 3 |  | Nathan R. Sturtevant:
Last-Branch and Speculative Pruning Algorithms for Maxn.
IJCAI 2003: 669-678 |
| 2002 |
| 2 |  | Nathan R. Sturtevant:
A Comparison of Algorithms for Multi-player Games.
Computers and Games 2002: 108-122 |
| 2000 |
| 1 |  | Nathan R. Sturtevant,
Richard E. Korf:
On Pruning Techniques for Multi-Player Games.
AAAI/IAAI 2000: 201-207 |