|
|
|
*. All email submissions should
be in PLAIN ASCII TEXT. *. Do not send word docs. |
Dr. Yoonsuck Choe
Email: choe(a)tamu.edu
Office: HRBB 322B
Phone: 845-5466
Office hours: MWF 1:30-2:30PM, and other times by appointment.
Dwi Widyantoro
Email: dhw7942(a)cs.tamu.edu
Office: HRBB 326
Phone: 845-8865
Office hours: T/W/TH 2:30pm-3:30pm, HRBB 326.
CPSC 311
MWF 10:20-11:10 Zach 105B
To understand the problems in AI and learn the diverse approaches to solve the problems:
- traditional AI techniques (search, pattern matching, logic, theorem proving, etc.) to tangible problems.
- modern approaches in AI (learning, genetic algorithms, etc.).
- inspirations from processes in the brain.
Stuart Russell and Peter Norvig, Artificial Intelligence: A Modern Approach, Prentice Hall, New Jersey, 1995.
ISBN 0-13-103805-2
Book Homepage
Installed in /usr/local/bin/gcl on all CS unix machines (robert, dogbert, etc.).
See the Calendar section below for reading and other assignments for each week.
- Introduction : 1 week
- LISP : 1 week
- Search : 3 weeks
- Game Playing : 1 week
- Propositional Logic, Predicate Calculus : 4 weeks
- Learning : 2 weeks
- Special Topics : 2 weeks
Grading will be on the absolute scale. The cutoff for an `A' will be at most 90% of total score, 80% for a `B', 70% for a `C', and 60% for a `D'. However, these cutoffs might be lowered at the end of the semester to accomodate the actual distribution of grades.
All incidents of academic dishonesty will be dealt with according to the university policy. No exceptions.
- All work should be done strictly individually. No discussions are allowed at all, except for those in the class under the supervision of the instructor.
- All references must be properly cited, including internet web pages (URL must be provided). If plagarism is detected, i.e. without proper citation and quotation, you will automatically receive an F. When in doubt, please ask the instructor if it is reasonable to include other's work in your assignments.
* many ideas in the current lectures were borrowed from these courses
Fall Semester 2002 *
August 28-30 Wednesday-Friday. Registration. August 30 Friday. Last day to register for fall semester classes and pay fees. September 2 Monday. First day of fall semester classes. September 5 Thursday. Last day for dropping courses with no record. September 6 Friday. Last day for adding courses for the fall semester. September 13 Friday. Last day to apply for all degrees to be awarded in December. October 3 Thursday. Academic Convocation. Classes will be held. October 21 Monday. Mid-semester grades due in Registrar’s Office, noon. November 8 Friday. Last day for all students to drop courses with no penalty (Q-Drop).
Last day to change Kinesiology 198/199 to S/U grade on BONFIRE.
Last day to officially withdraw from the University.November 11 -
December 12Monday-Thursday. Pre-registration for 2003 spring semester. November 28-29 Thursday-Friday. Thanksgiving. Faculty and staff holiday. December 9 Monday. Redefined day, students attend their Friday classes.
Dead day, classes meet but no major exams.December 10 Tuesday. Last day of fall semester classes.
Redefined day, students attend their Thursday classes.
Dead day, classes meet but no major exams.December 11-12 Wednesday-Thursday. Reading days, no classes. December 13, 16-18 Friday, Monday-Wednesday. Fall semester final examinations for all students. December 20** Friday. Final grades for all students due in Registrar’s Office, noon.
Last day for undergraduate degree candidates for December to apply for $1000 Tuition Rebate, 5:00pm.December 20-21 Friday-Saturday. Commencement and Commissioning. December 23-31 Monday-Tuesday. Faculty and staff holiday. *All dates and times are subject to change.
**To have sufficient time to process grades and send data to deans and students, all final grades need to be received by noon on this date.
Approved 2/12/2002 (OAR)
Lisp drill (symbolic differentiation): handout will be available in class during week 2.
Here's a small example that will help you get started:Create a file "test.lsp" containing this line: (defun mysqr (x) (* x x)) and save it. Then, run gcl and load it like below, and then run the newly defined function mysqr. ------------------------------- >(load "test.lsp") Loading test.lsp Finished loading test.lsp T >(mysqr 100) 10000 >(mysqr 5) 25 >(bye)
* When reading the chapters, you do not have to memorize everything. A separate list of terms you need to know will be handed out prior to each exam. *