A list of research labs and contact information for job hunters (thanks to Jian Yin).
Some algorithms are more efficient than others. We would prefer to chose an efficient algorithm, so it would be nice to have metrics for comparing algorithm efficiency. The complexity of an algorithm ...
Our students and faculty are changing the world through their contributions to computing education, research, and industry. These awards received by members of the UT Computer Science community make ...
Programming Contests at UT is a chapter of the ICPC: International Collegiate Programming Contest. The International Collegiate Programming Contest is an algorithmic programming contest for college ...
Artificial Intelligence and Life in 2030. Peter Stone, Rodney Brooks, Erik Brynjolfsson, Ryan Calo, Oren Etzioni, Greg Hager, Julia Hirschberg, Shivaram ...
Welcome to GRACS. We are here to help CS grad students in any way we can. If you need information on degree requirements, research techniques, teaching tools, or things to do in Austin, then you've ...
Every year, we send four teams (each consisting of three students) to the tri-state South Central Regional. One team from UT Austin might advance to the North America Championship and the World Finals ...
Haresh Karnan, Anirudh Nair, Xuesu Xiao, Garrett Warnell, Soren Pirk, Alexander Toshev, Justin Hart, Joydeep Biswas, and Peter Stone. Socially CompliAnt Navigation Dataset (SCAND): A Large-Scale ...
Left image shows an Iso-surface Rendering of the Haloarcula Marismortui Large Ribosomal 50S subunit (1JJ2) crystal structure(cf. Klein, Schmeing, Moore, Steitz) and based on protein and RNA ...
Deep Recurrent Q-Learning for Partially Observable MDPs Deep Recurrent Q-Learning for Partially Observable MDPs. Matthew Hausknecht and Peter Stone. In AAAI Fall Symposium on Sequential Decision ...
Content: This undergraduate course will cover the basics of algorithms and complexity, including dynamic programming, greedy algorithms, graph algorithms, linear programming, and NP-hardness.