Teaching

• Weekly schedule
• CS310 Computer Organization and Design
• CS399/CS490 Internship/Practicum
• MATH212 Mathematics for Computer Science

• CS125 Web Site Development: Fall 2010
• CS142 Elementary Programming in Visual Basic: Fall 2005 (x2)
• CS221 Object-Oriented Design and Programming I: Spring 2006 (x2), Fall 2006, Spring 2007 (x2), Fall 2007
• CS251 Computer Organization and Assembly Language: Fall 2010, Spring 2011, Fall 2012
• CS262 Object-Oriented Design and Programming II: Spring 2009
• CS271 Data Structures: Fall 2007, Fall 2008
• CS300 Artificial Intelligence: Fall 2009
• CS310 Computer Organization and Design: Fall 2011
• CS321 File Structures: Fall 2005, Fall 2006, Fall 2007, Fall 2008
• CS331 Programming Languages: Spring 2007, Spring 2008, Spring 2009, Spring 2010
• CS381 Introduction to the Theory of Computing: Fall 2006, Spring 2008, Fall 2009, Spring 2011, Fall 2012
• CS399/490 Internship/Practicum: Spring 2008, Spring 2011, Fall 2011, Spring 2012, Fall 2012
• CS421 Operating Systems: Spring 2010
• CS431 Compilers: Fall 2008, Fall 2009, Fall 2010, Fall 2011
• CS480 Topics in Computer Science: Heuristic Search: Spring 2006
• MATH212 Mathematics for Computer Science: Spring 2012

Professional Experience

Curriculum Vitae

• [pdf]

Main Research Interests

• Artificial Intelligence (AI)
  • Heuristic search, including real-time, offline, incremental, and anytime search
    
    

    In the summer of 2008, Sven Koenig, Wheeler Ruml, Rong Zhou, and I organized and co-chaired the First International Symposium on Search Techniques in Artificial Intelligence and Robotics.

    
    
  • Planning and replanning
  • Reinforcement learning
• Algorithm visualization for CS education
  • JHAVEPOP: Automated visualization of linked lists in C++ or Java (similar to Jeffrey Popyack's Pascal Pointers)

Projects

• The JHAVE algorithm visualization environment
• The Bantam Java compiler infrastructure

Affiliations

• AAAI  
• ACM
• SIGCSE
• SIGART
• Past affiliations: Intelligent Systems Group , College of Computing , Georgia Institute of Technology
  

Journal Articles, Magazine Articles, and Book Chapters

• (with D. Penniston) Congruences for ℓ-Regular Partition Functions Modulo 3 ; Ramanujan Journal; Vol. 27 (1); p. 101-108; January 2012; DOI 10.1007/s11139-011-9312-3
  
  
• (with A. Felner , R. Holte , R. Meshulam, and J. Newton ) Maximizing over Multiple Pattern Databases Speeds up Heuristic Search ; Artificial Intelligence; Vol. 170 (16-17); p. 1123-1136; November 2006
  
  
• (with S. Koenig , M. Likhachev , and Y. Liu ) Incremental Heuristic Search in AI; Artificial Intelligence Magazine ; Vol. 25 (2); p. 99-112; Summer 2004
  [bibtex ]
   
• (with S. Koenig and M. Likhachev ) Lifelong Planning A*; Artificial Intelligence; Vol. 155 (1-2); p. 93-146; May 2004
  [bibtex ]
   
• (with S. Koenig ) STRIPS, In L. Nadel (Ed.), Encyclopedia of Cognitive Science; London: Macmillan; December 2002
   

Conference and Workshop Articles

• (with C. Jenkins and A. Voss) An Effective Educational Module for Booth's Multiplication Algorithm; Published in: Journal of Computing Sciences in Colleges, Vol. 27(4), pages 54-62, April 2012
   
• (with G. Thomas) Designing Effective Heterogeneous Teams for Multiagent Routing Domains; International Conference on Intelligent Agent Technology (IAT); p. 341-348; 2011
   
• (with M. Corliss, J. Davis, and L. Pietraszek) Bantam Java Compiler Project: Experiences and Extensions; Accepted at CCSC:NE-2010
   
• JHAVEPOP: Visualizing Linked-List Operations in C++ and Java; Accepted at CCSC:MW-2009; Published in: Journal of Computing Sciences in Colleges, Vol. 25(1), pages 32-41, October 2009
   
• (with T. Naps, and Jason Wentworth) Sorting Out Sorting - The Sequel; Accepted at ITiCSE-08
   
• (with S. Grissom, M. McNally, T. Naps, and C. Trefftz) Supporting the Rapid Development of Pedagogically Effective Algorithm Visualizations; Accepted at CCSC:MW-2007
   
• (with A. Jungwirth and T. Naps) BlockTree: Pedagogical Information Visualization for Heuristic Search; Accepted at FLAIRS-2007
   
• ITSA*: Iterative Tunneling Search with A*; AAAI Workshop on Heuristic Search, Memory-Based Heuristics and Their Applications; p. 21-26; 2006
  [pdf]
   
• (with S. Koenig) Limited discrepancy Beam Search; Nineteenth International Joint Conference on Artificial Intelligence (IJCAI); p. 125-131; 2005
   
• (with S. Koenig) Scaling up WA* with Commitment and Diversity; Nineteenth International Joint Conference on Artificial Intelligence (IJCAI); p. 1521-1522; 2005
   
• (with A. Felner , R. Holte , R. Meshulam, and J. Newton ) Multiple Pattern Databases ; 14th International Conference on Automated Planning & Scheduling (ICAPS); p. 122-131; 2004 (runner-up for Best Paper Award)
  [ps ][pdf ][bibtex]
   
• (with S. Koenig and Y. Liu ) Speeding up the Calculation of Heuristics for Heuristic Search-Based Planning ; National Conference on Artificial Intelligence (AAAI); p. 484-491; 2002
  [ps ] [pdf ] [bibtex ]
   
• (with C. Bauer and S. Koenig ) Heuristic Search-Based Replanning ; International Conference on Artificial Intelligence Planning & Scheduling (AIPS); p. 310-317; 2002
  [ps ] [pdf ] [bibtex ]
   
• (with S. Koenig ) Combining Two Fast-Learning Real-Time Search Algorithms Yields Even Faster Learning ; European Conference on Planning (ECP); 2001
  [ps ] [pdf ] [bibtex ]
   
• (with S. Koenig ) Speeding up the Convergence of Real-Time Search ; National Conference on Artificial Intelligence (AAAI); p. 891-897; 2000
  [ps ] [pdf ] [bibtex ]
   

Edited Proceedings

• D. Furcy, S. Koenig, W. Ruml and R. Zhou (editors), Proceedings of the AAAI-08 Workshop on Search in Artificial Intelligence and Robotics, AAAI Press (WS-08-10), 2008.

Conference Reports

• R. Bunescu, V. Carvalho, J. Chomicki, V. Conitzer, M. Cox, V. Dignum, Z. Dodds, M. Dredze, D. Furcy, E. Gabrilovich, M. Göker, H. Guesgen, H. Hirsh, D. Jannach, U. Junker, W. Ketter, A. Kobsa, S. Koenig, T. Lau, L. Lewis, E. Matson, T. Metzler, R. Mihalcea, B. Mobasher, J. Pineau, P. Poupart, A. Raja, W. Ruml, N. Sadeh, G. Shani, D. Shapiro, S. Singh, M. Taylor, K. Wagstaff, T. Smith, W. Walsh, and R. Zhou, AAAI 2008 Workshop Reports, Artificial Intelligence Magazine, Volume 30(1), pages 108-118, 2009.

Technical Reports and Theses

• Limited Discrepancy Beam Search; Technical Report GIT-COGSCI-2004/02; College of Computing, Georgia Institute of Technology, Atlanta; May 2004
   
• Scaling up Weighted A* with Commitment and Diversity; Technical Report GIT-COGSCI-2004/01; College of Computing, Georgia Institute of Technology, Atlanta; May 2004
   
• eFALCONS: Speeding up the Convergence of Real-Time Search Even More; Technical Report GIT-COGSCI-2001/04; College of Computing, Georgia Institute of Technology, Atlanta; July 2001
   
• (with S. Koenig )  Speeding up the Convergence of Real-Time Search: Empirical Setup and Proofs ; Technical Report GIT-COGSCI-2000/01; College of Computing, Georgia Institute of Technology, Atlanta; March 2000
[ps ] [ pdf ]
 
• Formal description of and experiments with Knuth-Bendix-based theorem proving in Otter; M.S. thesis; Computer Science Department , University of Iowa ; July 1997
   
• Suivi de systêmes dynamiques à partir de scénarios temporels. Application au suivi d'une flotte de taxis-robots (in French); Mémoire de DEA (M.S. thesis); Heudiasyc , Université de Technologie de Compiègne ; September 1994