Home * People * Austin Parker

Austin Parker,
an American computer scientist and Ph.D. in 2008 from University of Maryland, College Park under Dana Nau and V.S. Subrahmanian ^[1]. His research interests include computational decision making and knowledge representation, in particularly probabilistic spatial temporal knowledge. Along with Dana Nau et al., he further worked and published on search pathology and how to avoid it ^[2]. As game programmer, he is author of the KriegSpiel bot Kbott, which played the 11th Computer Olympiad, KriegSpiel 2006 in Turin ^[3].

Selected Publications

^[4]

• Austin Parker, Dana Nau, V.S. Subrahmanian (2005). Game-Tree Search with Combinatorially Large Belief States. IJCAI 2005, pdf » KriegSpiel
• Austin Parker (2008). Spatial Probabilistic Temporal Databases. Ph.D. thesis, University of Maryland, College Park, advisors Dana Nau and V.S. Subrahmanian
• Brandon Wilson, Austin Parker, Dana Nau (2009). Error Minimizing Minimax: Avoiding Search Pathology in Game Trees. pdf
• Dana Nau, Mitja Luštrek, Austin Parker, Ivan Bratko, Matjaž Gams (2010). When is it better not to look ahead?. Artificial Intelligence, Vol. 174, No. 16–17, preprint as pdf

External Links

• Austin Parker | LinkedIn
• Austin Parker | UMD Department of Computer Science
• Austin Parker's ICGA Tournaments

References

1. ^ Dana Nau's Students
2. ^ Brandon Wilson, Austin Parker, Dana Nau (2009). Error Minimizing Minimax: Avoiding Search Pathology in Game Trees. pdf
3. ^ 11th Computer Olympiad, KriegSpiel - Turin 2006 (ICGA Tournaments)
4. ^ dblp: Austin Parker

What links here?

Up one level