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