« Lecture #Syllabus for all sect | Main | Project #Syllabus for all sect »
March 27, 2006
Project #Syllabus for all sect
In project #6, you solve the TSP using a probabilistic algorithm of the Monte Carlo variety and conduct experiments to compare the performance of your new algorithm with the performance of your deterministic algorithm from project #5.
Note that we have decided to eliminate the requirement for an Improvement Paper on project #6. Consequently, final grade weight on the project #6 report will be a full 6%.
3/28: Since there will be no improvement paper in conjunction with this project, we have decided to move the due date back to April 5th. Note also that the Early date has moved to April 3rd.
Posted by ringger at March 27, 2006 09:17 AM
Comments
On the project how are we supposed to have different execution times if we are always supposed to run for 10 seconds? (#3 in the project description )
Posted by: Matthew Mayer ![[TypeKey Profile Page]](http://vv.cs.byu.edu/cs312/nav-commenters.gif)
at March 30, 2006 08:35 PM
You are running your simple Monte Carlo algorithm repeatedly within the 10 sec. limit. You can measure the execution time of each run. It may be the case that each run will go so quickly that you will scarcely be able to measure it.
Posted by: ringger at March 31, 2006 07:17 AM
Post a comment
Thanks for signing in, . Now you can comment. (sign out)
(If you haven't left a comment here before, you may need to be approved by the site owner before your comment will appear. Until then, it won't appear on the entry. Thanks for waiting.)