Problem Solving with Constraints
the page will be regularly updated. Check it out regularly for announcements of required/recommended reading material, homework, etc.
Prereq: Instructor's permission
Course description: Constraint satisfaction has emerged as a powerful approach to articulate and solve many problems in computer science, engineering, and management. It is now the basis for new programming languages and innovative commercial systems for production scheduling, product configuration, personnel planning and timetabling, etc. The goal of this course is to prepare students to conduct research in this area. The course will be intensive and will require thorough study of the theory and the algorithms, and a significant implementation effort. Students are expected to be self motivated, and demonstrate intellectual independence and collegial collaboration.
Lectures: Monday, Wednesday 8:00 a.m. to 9:15 a.m.
Make-up Class/Recitation: By agreement
Instructor: Prof. Berthe Y. Choueiry
Volunteer GTA's & Office Hours:
Mr. Shant Karakashian
Office hours: Tuesday 2:00--3:00 P.M., held in AvH 123D or by appointment
Mr. Robert Woodward
Office hours: Thursday, 11:30--12:30 P.M., held in Avh 123D or by appointment
For quick response, email cse496cp AT cse.unl.edu. Your message will be forwarded to TA(s) and instructor.
Important note:We do not have a GTA allocated to this class. The two GTA's are volunteers. Please send all questions to cse496cp AT cse.unl.edu for a quick response.
Topics include but are not restricted to:
Last modified: Mon Oct 3 13:20:02 CDT 2011