Courses taught since Fall 1999

• Spring 2008:
• Introduction to Artificial Intelligence (CSCE 476/876), 8 students (5 ugrads, 3 grads), 3 crh
• Foundations of Constraint Processing (CSCE 421/821), 10 students (3 ugrads, 3 grad), 3 crh
• Fall 2007:
• Discrete Mathematics (CSCE 235), 27 students (27 ugrads, 0 grad), 3 crh
• Databases and Constraint Processing (CSCE 996), 1 grad, 3 crh
• Spring 2007:
• Structural Decomposition Methods for Constraint Satisfaction Problems (CSCE 999), 1 grad, 1 crh
• Consistency Techniques (CSCE 399H), 1 ugrad, 3 crh
• Data Fusion from Web Sources (USC, directed research), 1 grad,2 crh
• Graphical Data Acquisition for Combinatorial Games (USC, directed research), 1 grad,1 crh
• Fall 2006:
• Structural Decomposition Methods for Constraint Satisfaction Problems (CSCE 999), 1 grad,1 crh
• Constraint Processing for Scatter Chart Labeling (CSCE 899), 1 grad, 6 crh
• Summer 2006:
• Structural Decomposition Methods for Constraint Satisfaction Problems (CSCE 999), 1 grad, 3 crh
• Constraint Processing for Geospatial Reasoning (CSCE 996), 1 grad, 3 crh
• Interactive Problem Solving (CSCE 996), 1 grad, 3 crh
• Constraint Processing Techniques in Combinatorial Games (CSCE 496H), 1 undergrad, 3 crh
• Constraint Processing Techniques in Combinatorial Games (CSCE 399H), 1 undergrad, 3 crh
• Spring 2006:
• Introduction to Artificial Intelligence (CSCE 476/876), 12 students (9 ugrads, 3 grads), 3 crh
• Discrete Mathematics (CSCE 235), 15 students (14 ugrads, 1 grad), 3 crh
• Decomposition Methods for CSPs (CSCE 999), 1 grad, 6 crh
• Interactive Problem Solving (CSCE 897), 1 grad, 6 crh
• Constraint Processing Techniques in Combinatorial Games (CSCE 496H), 1 undergrad, 3 crh
• Fall 2005:
• Foundations of Constraint Processing (CSCE 421/821), 6 students (1 ugrad, 5 grads), 3 crh
• Decomposition Methods for CSPs (CSCE 999), 1 grad, 5 crh
• Interactive Problem Solving (CSCE 996), 1 grad, 3 crh
• Summer 2005:
• Breaking Symmetries During Search (CSCE 897), 1 grad, 2 crh
• Breaking Symmetries During Search (CSCE 897), 1 grad, 1 crh
• Spring 2005:
• Introduction to Artificial Intelligence (CSCE 476/876), 26 students (17 ugrads, 9 grads), 3 crh
• Neighborhood Interchangeability for Non-Binary CSPs and DataBases (CSCE 899), 1 grad, 1 crh
• Using Maximal Independent Sets to Decompose a CSP (CSCE 899), 1 grad, 5 crh
• Decomposition Methods for CSPs (CSCE 999), 1 grad, 5 crh
• Fall 2004:
• Foundations of Constraint Processing (CSCE 421/821), 10 students (4 ugrad, 6 grads), 3 crh
• Dynamic Bundling and applications to databases (CSCE 899), 1 grad, 1 crh
• Decomposition of Non-Binary CSPs (CSCE 999), 1 grad, 1 crh
• Summer 2004:
• Improving Stochastic Local Search Using Maximal Independent Sets (CSCE 899), 1 grad, 1 crh
• Interchangeability in Non-Binary CSPS and applications to Databases (CSCE 899), 1 grad, 3 crh
• Decomposition of Non-Binary CSPs (CSCE 999), 1 grad, 3 crh
• Spring 2004:
• Introduction to Artificial Intelligence (CSCE 476/876), 23 students (18 ugrads, 5 grads), 3 crh
• Interactive Problem Solving (CSCE 897), 1 grad, 6 crh
• Selective Query Processing (CSCE 996), 1 grad, 1 crh
• Advanced Systematic Search Techniques for Overconstrained Problems (CSCE 899), 1 grad, 1 crh
• Computation of Interchangeability in Finite CSPs (CSCE 899), 1 grad, 3 crh
• Investigation of Constraint Processing Techniques for Join Optimization (CSCE 996), 1 grad, 3 crh
• Fall 2003:
• Foundations of Constraint Processing (CSCE 421/821), 21 students (7 ugrad, 14 grads), 3 crh
• Weekly Lab Meeting , xx students (1 ugrad, xx grads), 0 crh
• Decomposition Techniques (CSCE 896), 1 grad, 3 crh
• Iterative Improvement Techniques for Tightly Constrained Satisfaction Problems (CSCE 899), 1 grad, 1 crh
• Stochastic Systematic Search (CSCE 899), 1 grad, 1 crh
• View Materialization in Databases (CSCE 996), 1 grad, 3 crh
• Masters project (CSCE 897), 1 grad, 3 crh
• Summer 2003:
• Iterative Search Techniques for Solving Over-Constrained CSPs (CSCE 899), 1 grad, 3 crh
• Discovering Symmetries in Planning (CSCE 899), 1 grad, 3 crh
• Interactive Problem Solving (CSCE 899), 1 grad, 3 crh
• CSP and DB Techniques (CSCE 996), 1 grad, 3 crh
• Planning Techniques in Computer Animation (CSCE 996), 1 grad, 3 crh
• Spring 2003:
• Advanced Constraint Processing (CSCE 990-06), 10 students (0 ugrads, 10 grads), 3crh
• Introduction to Artificial Intelligence (CSCE 476/876), 40 students (22 ugrads, 18 grads), 3 crh
• Communications for Computer Scientists (CSCE 996 CommCS), 12 students (0 ugrads, 12 grads), 1 crh
• Advanced Systematic Search Techniques for Overconstrained Problems (CSCE 899), 1 grad, 5 crh
• Study and Comparison of Consistency Algorithms (CSCE 897), 1 grad, 3 crh
• Local Search Techniques for Overconstrained Problems (CSCE 899), 1 grad, 3 crh
• Temporal Reasoning (CSCE 899), 1 grad, 9 crh
• Discovering Symmetries in Planning (CSCE 899), 1 grad, 3crh
• Fall 2002:
• Foundations of Constraint Processing (CSCE 421/821), 30 students (11 ugrad, 19 grads), 3 crh
• Local Search Techniques in Constrained Optimization (CSCE 899), 1 student, 3 crh
• Abstractions in Planning (CSCE 899). 1 grad, 3crh
• Constraint Algorithms for Temporal Constraint Problems (CSCE 996), 1 grad, 3crh
• Temporal Reasoning (CSCE 899), 1 grad, 3 crh.
• Summer 2002:
• Constraints in Computer Animation (CSCE 996), 1 grad, 1 crh
• Constraints in Computer Animation (CSCE 996), 1 grad, 1 crh
• Temporal Reasoning (CSCE 996). 1 grad, 3 crh
• Constraint Modeling and Reformulation (CSCE 996 ). 1 grad. 1 crh.
• Reformulation of Decomposable Constraints (CSCE 996). 1 grad. 1 crh
• Handling Preferences with Local Search Techniques (CSCE996). 1 grad, 3 crh
• Spring 2002:
• Introduction to Artificial Intelligence (CSCE 476/876), 42 students, 3 crh.
• Advanced Artificial Intelligence (CSCE976), 8 students, 3 crh.
• Dynamically detecting and Exploiting Symmetry in Finite Constraint Satisfaction Problems (CSCE 899), 1 grad, 3 crh.
• Fall 2001:
• Foundations of Constraint Satisfaction (CSCE 421/821). 19 students, 3 crh.
• A Constraint Processing Approach to Assigning Graduate Teaching Assistants to Courses (CSCE 496H), 1 ugrad, 3 crh
• Summer 2001:
• Discovering Symmetries in Constraint Satisfaction Problems (CSCE899). 1 grad, 3 crh.
• Mobile Communications (CSCE996). 1 grad, 3 crh.
• Spring 2001: Data Structures and Algorithms (CSCE310) 70 students, 3 crh.
• Spring 2001: Introduction to Artificial Intelligence (CSCE 476/876). 40 students, 3 crh.
• Fall 2000: Foundations of Constraint Satisfaction (CSCE 990). 2 grads (0 ugrad, 2 grads), 3 crh.
• Summer 2000:  Advanced AI Planning (CSCE 496). 1 grad, 3 crh.
• Spring 2000: Introduction to Artificial Intelligence (CSCE 476/876). 30-40 students, 3 crh.
• Fall 1999: Theory and Practice of Constraint Satisfaction (CSCE 990-05). 5 students (0 ugrad, 5 grads), 3 crh.