io-port.net

first | previous | 1 | next | last

Result 1 to 7 of 7 total

io-port 70127107 Furtak, Timothy; Buro, Michael

Using payoff-similarity to speed up search (English)

IJCAI, 534-539 (2011).

PDF XML AMS-TeX TEXT BIBTeX URL

io-port 70300779 Furtak, Timothy; Buro, Michael

On the complexity of two-player attrition games played on graphs (English)

AIIDE (2010).

PDF XML AMS-TeX TEXT BIBTeX URL

io-port 70984224 Long, Jeffrey Richard; Sturtevant, Nathan R.; Buro, Michael; Furtak, Timothy

Understanding the success of perfect information Monte Carlo sampling in game tree search (English)

AAAI (2010).

PDF XML AMS-TeX TEXT BIBTeX URL

io-port 70124417 Furtak, Timothy; Buro, Michael

Minimum proof graphs and fastest-cut-first search heuristics (English)

IJCAI, 492-498 (2009).

PDF XML AMS-TeX TEXT BIBTeX URL

io-port 70128490 Buro, Michael; Long, Jeffrey Richard; Furtak, Timothy; Sturtevant, Nathan R.

Improving state evaluation, inference, and search in trick-based card games (English)

IJCAI, 1407-1413 (2009).

PDF XML AMS-TeX TEXT BIBTeX URL

io-port 70600199 Furtak, Timothy; Amaral, José Nelson; Niewiadomski, Robert

Using SIMD registers and instructions to enable instruction-level parallelism in sorting algorithms (English)

SPAA, 348-357 (2007).

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 70127858 Furtak, Timothy; Kiyomi, Masashi; Uno, Takeaki; Buro, Michael

Generalized amazons is PSPACE-complete (English)

IJCAI, 132-137 (2005).

PDF XML AMS-TeX TEXT BIBTeX URL

first | previous | 1 | next | last

Result 1 to 7 of 7 total