default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael Buro
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i10]Douglas Rebstock, Christopher Solinas, Nathan R. Sturtevant, Michael Buro:
Transformer Based Planning in the Observation Space with Applications to Trick Taking Card Games. CoRR abs/2404.13150 (2024)- 2023
- [c54]Christopher Solinas, Douglas Rebstock, Nathan R. Sturtevant, Michael Buro:
History Filtering in Imperfect Information Games: Algorithms and Complexity. NeurIPS 2023 - [i9]Christopher Solinas, Douglas Rebstock, Nathan R. Sturtevant, Michael Buro:
History Filtering in Imperfect Information Games: Algorithms and Complexity. CoRR abs/2311.14651 (2023) - 2022
- [j22]Weijiang Feng
, Long Lan, Michael Buro, Zhigang Luo:
Online Multiple-Pedestrian Tracking With Detection-Pair-Based Graph Convolutional Networks. IEEE Internet Things J. 9(24): 25086-25099 (2022) - 2021
- [c53]Varun Bhatt, Michael Buro:
Inference-Based Deterministic Messaging For Multi-Agent Communication. AAAI 2021: 11228-11236 - [c52]Jake Tuero, Michael Buro:
Bayes DistNet - A Robust Neural Network for Algorithm Runtime Distribution Predictions. AAAI 2021: 12418-12426 - [i8]Varun Bhatt, Michael Buro:
Inference-Based Deterministic Messaging For Multi-Agent Communication. CoRR abs/2103.02150 (2021) - 2020
- [i7]Arta Seify, Michael Buro:
Single-Agent Optimization Through Policy Iteration Using Monte-Carlo Tree Search. CoRR abs/2005.11335 (2020) - [i6]Jake Tuero, Michael Buro:
Bayes DistNet - A Robust Neural Network for Algorithm Runtime Distribution Predictions. CoRR abs/2012.07197 (2020)
2010 – 2019
- 2019
- [j21]Nicolas A. Barriga, Marius Stanescu, Felipe Besoain, Michael Buro:
Improving RTS Game AI by Supervised Policy Learning, Tactical Search, and Deep Reinforcement Learning. IEEE Comput. Intell. Mag. 14(3): 8-18 (2019) - [c51]Christopher Solinas, Douglas Rebstock, Michael Buro:
Improving Search with Supervised Learning in Trick-Based Card Games. AAAI 2019: 1158-1165 - [c50]David Churchill, Michael Buro, Richard Kelly:
Robust Continuous Build-Order Optimization in StarCraft. CoG 2019: 1-8 - [c49]Douglas Rebstock, Christopher Solinas, Michael Buro:
Learning Policies from Human Data for Skat. CoG 2019: 1-8 - [c48]Douglas Rebstock, Christopher Solinas, Michael Buro, Nathan R. Sturtevant:
Policy Based Inference in Trick-Taking Card Games. CoG 2019: 1-8 - [i5]Christopher Solinas, Douglas Rebstock, Michael Buro:
Improving Search with Supervised Learning in Trick-Based Card Games. CoRR abs/1903.09604 (2019) - [i4]Douglas Rebstock, Christopher Solinas, Michael Buro:
Learning Policies from Human Data for Skat. CoRR abs/1905.10907 (2019) - [i3]Douglas Rebstock, Christopher Solinas, Michael Buro, Nathan R. Sturtevant:
Policy Based Inference in Trick-Taking Card Games. CoRR abs/1905.10911 (2019) - 2018
- [j20]Brian Magerko, Julio César Bahamón, Michael Buro, Rossana Damiano, Jo Mazeika, Santiago Ontañón, Justus Robertson, James Ryan, Kristin Siu:
The 13th AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment. AI Mag. 39(2): 75-78 (2018) - [j19]Nicolas A. Barriga, Marius Stanescu, Michael Buro:
Game Tree Search Based on Nondeterministic Action Scripts in Real-Time Strategy Games. IEEE Trans. Games 10(1): 69-77 (2018) - [c47]Marius Stanescu, Michael Buro:
Spatial Action Decomposition Learning Applied to RTS Combat Games. AIIDE Workshops 2018 - 2017
- [c46]Nicolas A. Barriga, Marius Stanescu, Michael Buro:
Combining Strategic Learning with Tactical Search in Real-Time Strategy Games. AIIDE 2017: 9-15 - [c45]Shuyi Zhang, Michael Buro:
Improving hearthstone AI by learning high-level rollout policies and bucketing chance node events. CIG 2017: 309-316 - [i2]Nicolas A. Barriga, Marius Stanescu, Michael Buro:
Combining Strategic Learning and Tactical Search in Real-Time Strategy Games. CoRR abs/1709.03480 (2017) - 2016
- [j18]Camille Barot, Michael Buro, Michael Cook, Mirjam Palosaari Eladhari, Boyang Li, Antonios Liapis, Magnus Johansson, Josh McCoy, Santiago Ontañón, Jonathan P. Rowe, Emmett Tomai, Harko Verhagen, Alexander Zook:
The AIIDE 2015 Workshop Program. AI Mag. 37(2): 91-94 (2016) - [j17]Michael Buro, Santiago Ontañón, Mike Preuss:
Guest Editorial Real-Time Strategy Games. IEEE Trans. Comput. Intell. AI Games 8(4): 317-318 (2016) - [c44]Marius Stanescu, Nicolas A. Barriga, Andy Hess, Michael Buro:
Evaluating real-time strategy game states using convolutional neural networks. CIG 2016: 1-7 - 2015
- [j16]Tiffany Barnes, Oliver Bown, Michael Buro, Michael Cook, Arne Eigenfeldt, Héctor Muñoz-Avila, Santiago Ontañón, Philippe Pasquier, Noriko Tomuro, Robert Michael Young, Alexander Zook:
Reports of the Workshops Held at the Tenth AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment. AI Mag. 36(1): 99-102 (2015) - [c43]Nicolas Arturo Barriga, Marius Stanescu, Michael Buro:
Puppet Search: Enhancing Scripted Behavior by Look-Ahead Search with Applications to Real-Time Strategy Games. AIIDE 2015: 9-15 - [c42]David Churchill, Michael Buro:
Hierarchical Portfolio Search: Prismata's Robust AI Architecture for Games with Large Search Spaces. AIIDE 2015: 16-22 - [c41]Marius Adrian Stanescu, Nicolas A. Barriga, Michael Buro:
Using Lanchester Attrition Laws for Combat Prediction in StarCraft. AIIDE 2015: 86-92 - [c40]Santiago Ontañón, Michael Buro:
Adversarial Hierarchical-Task Network Planning for Complex Real-Time Games. IJCAI 2015: 1652-1658 - 2014
- [c39]Michael Buro, David Churchill:
AIIDE 2014 StarCraft Competition. AIIDE 2014 - [c38]Graham Kurtis Stephen Erickson, Michael Buro:
Global State Evaluation in StarCraft. AIIDE 2014 - [c37]Marius Stanescu, Nicolas A. Barriga, Michael Buro:
Hierarchical Adversarial Search Applied to Real-Time Strategy Games. AIIDE 2014 - [c36]Nicolas A. Barriga, Marius Stanescu, Michael Buro:
Parallel UCT search on GPUs. CIG 2014: 1-7 - [c35]Marius Stanescu, Nicolas A. Barriga, Michael Buro:
Introducing Hierarchical Adversarial Search, a Scalable Search Procedure for Real-Time Strategy Games. ECAI 2014: 1099-1100 - 2013
- [j15]Mark O. Riedl, Gita Reese Sukthankar, Arnav Jhala, Jichen Zhu, Santi Ontañón Villar, Michael Buro, David Churchill:
The Eighth AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment. AI Mag. 34(1): 87-89 (2013) - [c34]Michael Buro, David Churchill:
AIIDE 2013 StarCraft Competition. AIIDE 2013 - [c33]Marius Stanescu, Sergio Poo Hernandez, Graham Erickson, Russell Greiner, Michael Buro:
Predicting Army Combat Outcomes in StarCraft. AIIDE 2013 - [c32]David Churchill, Michael Buro:
Portfolio greedy search and simulation for large-scale combat in starcraft. CIG 2013: 1-8 - [c31]Timothy Furtak, Michael Buro:
Recursive Monte Carlo search for imperfect information games. CIG 2013: 1-8 - [p2]Peter I. Cowling, Michael Buro, Michal Bída, Adi Botea, Bruno Bouzy, Martin V. Butz, Philip Hingston, Hector Muñoz-Avila, Dana S. Nau, Moshe Sipper:
Search in Real-Time Video Games. Artificial and Computational Intelligence in Games 2013: 1-19 - [p1]Adi Botea, Bruno Bouzy, Michael Buro, Christian Bauckhage, Dana S. Nau:
Pathfinding in Games. Artificial and Computational Intelligence in Games 2013: 21-31 - 2012
- [j14]Vadim Bulitko, Mark O. Riedl, Arnav Jhala, Michael Buro, Nathan R. Sturtevant:
Recap of the Seventh AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment (AIIDE). AI Mag. 33(1): 51-54 (2012) - [j13]Michael Buro, David Churchill:
Real-Time Strategy Game Competitions. AI Mag. 33(3): 106-108 (2012) - [c30]Abdallah Saffidine, Hilmar Finnsson, Michael Buro:
Alpha-Beta Pruning for Games with Simultaneous Moves. AAAI 2012: 556-562 - [c29]Michael Buro, David Churchill:
AIIDE 2012 StarCraft Competition. AIIDE 2012 - [c28]David Churchill, Abdallah Saffidine, Michael Buro:
Fast Heuristic Search for RTS Game Combat Scenarios. AIIDE 2012 - 2011
- [c27]David Churchill, Michael Buro:
Build Order Optimization in StarCraft. AIIDE 2011 - [c26]Timothy Furtak, Michael Buro:
Using Payoff-Similarity to Speed Up Search. IJCAI 2011: 534-539 - [c25]Jeffrey Richard Long, Michael Buro:
Real-Time Opponent Modeling in Trick-Taking Card Games. IJCAI 2011: 617-622 - 2010
- [c24]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: 134-140 - [c23]Timothy Furtak, Michael Buro:
On the Complexity of Two-Player Attrition Games Played on Graphs. AIIDE 2010
2000 – 2009
- 2009
- [c22]Timothy Furtak, Michael Buro:
Minimum Proof Graphs and Fastest-Cut-First Search Heuristics. IJCAI 2009: 492-498 - [c21]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 - 2007
- [c20]Michael Buro, Alexander Kovarsky:
Concurrent Action Execution with Shared Fluents. AAAI 2007: 950-955 - [c19]M. Renee Jansen, Michael Buro:
HPA* Enhancements. AIIDE 2007: 84-87 - [c18]Franisek Sailer, Michael Buro, Marc Lanctot:
Adversarial Planning Through Strategy Simulation. CIG 2007: 80-87 - 2006
- [c17]Douglas Demyen, Michael Buro:
Efficient Triangulation-Based Pathfinding. AAAI 2006: 942-947 - [c16]Nathan R. Sturtevant, Michael Buro:
Improving Collaborative Pathfinding Using Map Abstraction. AIIDE 2006: 80-85 - 2005
- [j12]Dave Gomboc, Michael Buro, T. Anthony Marsland:
Tuning evaluation functions by maximizing concordance. Theor. Comput. Sci. 349(2): 202-229 (2005) - [c15]Nathan R. Sturtevant, Michael Buro:
Partial Pathfinding Using Map Abstraction and Refinement. AAAI 2005: 1392-1397 - [c14]Alexander Kovarsky, Michael Buro:
Heuristic Search Applied to Abstract Combat Games. Canadian AI 2005: 66-78 - [c13]Michael Chung, Michael Buro, Jonathan Schaeffer:
Monte Carlo Planning in RTS Games. CIG 2005 - [c12]Timothy Furtak, Masashi Kiyomi, Takeaki Uno, Michael Buro:
Generalized Amazons is PSPACE-Complete. IJCAI 2005: 132-137 - [c11]Nathan R. Sturtevant, Vadim Bulitko, Michael Buro:
Automatic State Abstraction for Pathfinding in Real-Time Video Games. SARA 2005: 362-364 - 2004
- [c10]Thomas Hauk, Michael Buro, Jonathan Schaeffer:
Rediscovering *-Minimax Search. Computers and Games 2004: 35-50 - [c9]Thomas Hauk, Michael Buro, Jonathan Schaeffer:
*-Minimax Performance in Backgammon. Computers and Games 2004: 51-66 - 2003
- [c8]Dave Gomboc, T. Anthony Marsland, Michael Buro:
Evaluation Function Tuning via Ordinal Correlation. ACG 2003: 1-18 - [c7]Albert Xin Jiang, Michael Buro:
First Experimental Results of ProbCut Applied to Chess. ACG 2003: 19-32 - [c6]Michael Buro:
Solving the Oshi-Zumo Game. ACG 2003: 361-366 - [c5]Michael Buro:
Real-Time Strategy Games: A New AI Research Challenge. IJCAI 2003: 1534-1535 - 2002
- [j11]Michael Buro:
Improving heuristic mini-max search by supervised learning. Artif. Intell. 134(1-2): 85-99 (2002) - [c4]Michael Buro:
ORTS: A Hack-Free RTS Game Environment. Computers and Games 2002: 280-291 - [c3]Michael Buro:
The evolution of strong othello programs. IWEC 2002: 81-88 - 2000
- [c2]Michael Buro:
Simple Amazons Endgames and Their Connection to Hamilton Circuits in Cubic Subgrid Graphs. Computers and Games 2000: 250-261
1990 – 1999
- 1999
- [j10]Michael Buro:
Toward Opening Book Learning. J. Int. Comput. Games Assoc. 22(2): 98-102 (1999) - [j9]Michael Buro:
Efficient Approximation of Backgammon Race Equities. J. Int. Comput. Games Assoc. 22(3): 133-142 (1999) - 1998
- [c1]Michael Buro:
From Simple Features to Sophisticated Evaluation Functions. Computers and Games 1998: 126-145 - 1997
- [j8]Michael Buro:
The Othello Match of the Year: Takeshi Murakami vs. Logistello. J. Int. Comput. Games Assoc. 20(2): 139 (1997) - [j7]Michael Buro:
Call for Papers. Workshop on Game-Tree Search in the Past, Present, and Future. J. Int. Comput. Games Assoc. 20(2): 140 (1997) - [j6]Michael Buro:
The Othello Match of the Year: Takeshi Murakami vs. Logistello. J. Int. Comput. Games Assoc. 20(3): 189-193 (1997) - 1996
- [j5]Michael Buro, Hans Kleine Büning:
On Resolution with Short Clauses. Ann. Math. Artif. Intell. 18(2-4): 243-260 (1996) - [j4]Michael Buro:
Statistical Feature Combination for the Evaluation of Game Positions. J. Int. Comput. Games Assoc. 19(1): 32 (1996) - 1995
- [j3]Michael Buro:
ProbCut: An Effective Selective Extension of the α-β Algorithm. J. Int. Comput. Games Assoc. 18(2): 71-76 (1995) - [j2]Michael Buro:
Statistical Feature Combination for the Evaluation of Game Positions. J. Artif. Intell. Res. 3: 373-382 (1995) - [i1]Michael Buro:
Statistical Feature Combination for the Evaluation of Game Positions. CoRR abs/cs/9512106 (1995) - 1994
- [b1]Michael Buro:
Techniken für die Bewertung von Spielsituationen anhand von Beispielen. University of Paderborn, Germany, 1994, pp. I-VI, 1-87 - 1993
- [j1]Michael Buro:
On the Maximum Length of Huffman Codes. Inf. Process. Lett. 45(5): 219-223 (1993)
Coauthor Index
aka: Nicolas Arturo Barriga
aka: Marius Adrian Stanescu
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-21 02:38 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
