Results for round 1Programs were tested by running each with 30 graphs for 10 minutes. 10 of the graphs had a frequency assingment of size 8, 10 had an assignment of size 11 and last 10 had assignment of size 13. The quality of a solution was calculated with the formula goodness = 1000 * (found - optimal) / (degree +1 - optimal) where degree is the degree of the graph (every graph has a coloring of degree+1 that can be found with a greedy algorithm). The goodness of solutions were summed and extra points granted according to the sums
[TCS main] [Contact Info] [Personnel] [Research] [Publications] [Software] [Studies] [News Archive] [Links] Latest update: 05 December 2006. |