CS 312, section 003: Schedule Archives

March 28, 2005

The plan for the rest of the semester

We will wrap up the TSP algorithm today. Wednesday (3/30) we will do the minimax algorithm and start linear programing if time permits. Friday (4/1) we will go into linear programing in earnest and stick with that through the last day of class.
Linear programing is not in the textbook. A handout will be made available before 4/1. Linear programing is an important topic because it gives you another way to think about optimization problems and ties together most of hte ideas from the whole course.
The last project is to code up the simplex method. In linear programming problems, half the "fun" is coming up with the formulation of the problem as a linear program. So this project will be a little different. We will give you a constraint satisfaction problem and you will formulate it as a linear program, convert it to slack form, implement the simplex method and use your implementation to solve the slack form of your linear program. That will simplify the project a little while focusing on the main ideas.

Posted by jones at 08:52 AM | Comments (0)

February 15, 2005

Phylo. project now due Friday 2/18

[Updated schedule] I think the workload was a little compressed over the last week and I think that the phylo project is harder than most people think. So be smart and get a head start on it.

Posted by jones at 08:51 AM | Comments (0)

February 10, 2005

Approximate schedule for recurrence relations

There's a handout (click on title to see the full post along with the link to the notes) on recurrence relations that I'll pass out in class on Friday. The schedule said it should be passed out on wednesady, but we are about 1 day behind. Updated 2/14 to include another section for today's class and more homework that will due 2/16.

Posted by jones at 07:11 PM | Comments (0)

January 03, 2005