 | 2011 |
|---|
| 7 |       | Timothy Furtak,
Michael Buro:
Using Payoff-Similarity to Speed Up Search.
IJCAI 2011: 534-539 |
| 2010 |
|---|
| 6 | | Jeffrey Richard Long,
Nathan R. Sturtevant,
Michael Buro,
Timothy Furtak:
Understanding the Success of Perfect Information Monte Carlo Sampling in Game Tree Search.
AAAI 2010 |
| 5 | | Timothy Furtak,
Michael Buro:
On the Complexity of Two-Player Attrition Games Played on Graphs.
AIIDE 2010 |
| 2009 |
|---|
| 4 | | Michael Buro,
Jeffrey Richard Long,
Timothy Furtak,
Nathan R. Sturtevant:
Improving State Evaluation, Inference, and Search in Trick-Based Card Games.
IJCAI 2009: 1407-1413 |
| 3 | | Timothy Furtak,
Michael Buro:
Minimum Proof Graphs and Fastest-Cut-First Search Heuristics.
IJCAI 2009: 492-498 |
| 2007 |
|---|
| 2 | | Timothy Furtak,
José Nelson Amaral,
Robert Niewiadomski:
Using SIMD registers and instructions to enable instruction-level parallelism in sorting algorithms.
SPAA 2007: 348-357 |
| 2005 |
|---|
| 1 | | Timothy Furtak,
Masashi Kiyomi,
Takeaki Uno,
Michael Buro:
Generalized Amazons is PSPACE-Complete.
IJCAI 2005: 132-137 |
Data released under the ODC-BY 1.0 license — See also our legal information page