<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
		>
<channel>
	<title>Comments on: And the winner is&#8230;</title>
	<atom:link href="http://blogs.mathworks.com/contest/2006/12/06/and-the-winner-is/feed/" rel="self" type="application/rss+xml" />
	<link>http://blogs.mathworks.com/contest/2006/12/06/and-the-winner-is/</link>
	<description>The MATLAB Programming Contest is a semi-annual competition where contestants submit MATLAB code to try to solve a challenge.  For more information, see http://www.mathworks.com/contest/overview.html</description>
	<lastBuildDate>Sat, 21 Jan 2012 14:45:27 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.2.1</generator>
	<item>
		<title>By: Rajiv Narayan</title>
		<link>http://blogs.mathworks.com/contest/2006/12/06/and-the-winner-is/#comment-2079</link>
		<dc:creator>Rajiv Narayan</dc:creator>
		<pubDate>Fri, 08 Dec 2006 23:57:25 +0000</pubDate>
		<guid isPermaLink="false">http://blogs.mathworks.com/contest/?p=56#comment-2079</guid>
		<description>I&#039;ve really enjoyed participating in these contests, and though my entries rarely figure at the top, I have found writing them to be addictive, and  a fun learning experience. One of the aspects that interests me is to examine different algorithmic approaches to a problem. I think it would be useful to be able to cluster or group submissions by using a source code similarity measure. I like the idea of a generality prize, and would also like to suggest a prize for the most readable/commented entry, in order to encourage clarity rather than obfuscation. Looking forward to the next puzzle!</description>
		<content:encoded><![CDATA[<p>I&#8217;ve really enjoyed participating in these contests, and though my entries rarely figure at the top, I have found writing them to be addictive, and  a fun learning experience. One of the aspects that interests me is to examine different algorithmic approaches to a problem. I think it would be useful to be able to cluster or group submissions by using a source code similarity measure. I like the idea of a generality prize, and would also like to suggest a prize for the most readable/commented entry, in order to encourage clarity rather than obfuscation. Looking forward to the next puzzle!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Niilo Sirola</title>
		<link>http://blogs.mathworks.com/contest/2006/12/06/and-the-winner-is/#comment-2078</link>
		<dc:creator>Niilo Sirola</dc:creator>
		<pubDate>Thu, 07 Dec 2006 18:39:16 +0000</pubDate>
		<guid isPermaLink="false">http://blogs.mathworks.com/contest/?p=56#comment-2078</guid>
		<description>Wasn&#039;t able to contribute much this time around, but the problem sure was interesting, as was the &quot;creative cheating&quot; discussions in the newsgroup.

I&#039;m still looking forward to see some future challenges in continuous variables rather than discrete. This would bring lots of new things to be tweaked like discretization and maybe finally favor Matlab BLAS routines over spaghetti code. Also, continuous test cases would have more &quot;information content&quot; making probing more difficult</description>
		<content:encoded><![CDATA[<p>Wasn&#8217;t able to contribute much this time around, but the problem sure was interesting, as was the &#8220;creative cheating&#8221; discussions in the newsgroup.</p>
<p>I&#8217;m still looking forward to see some future challenges in continuous variables rather than discrete. This would bring lots of new things to be tweaked like discretization and maybe finally favor Matlab BLAS routines over spaghetti code. Also, continuous test cases would have more &#8220;information content&#8221; making probing more difficult</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Daniel Nordlund</title>
		<link>http://blogs.mathworks.com/contest/2006/12/06/and-the-winner-is/#comment-2076</link>
		<dc:creator>Daniel Nordlund</dc:creator>
		<pubDate>Thu, 07 Dec 2006 14:40:38 +0000</pubDate>
		<guid isPermaLink="false">http://blogs.mathworks.com/contest/?p=56#comment-2076</guid>
		<description>I think it would be more rewarding with a contest that focuses on Matlab and it&#039;s language rather than probing and constant tweaking. During this contest I found that the most interesting part was the cheating entries. For example, that way I learned how powerful dynamic regexps are. I did not learn anything from looking at the winning entry.

Like someone wrote in the newsgroup, another round of Matlab Golf would be great! It&#039;s a lot of fun and you learn plenty about the Matlab language, syntax and functions you perhaps didn&#039;t know about such as TRACE and KRON.

Another idea, perhaps even more useful, would be a series of pure optimization challenges. It could be similar to the golf contest only the point would be to write the fastest code that produces the correct solution - e.g. finds the longest palindrom in a string or &quot;the heaviest box&quot; of a matrix. Just use a similar but slightly different data set for the final evaluation of entries to make sure people can&#039;t probe and then use lookup tables.</description>
		<content:encoded><![CDATA[<p>I think it would be more rewarding with a contest that focuses on Matlab and it&#8217;s language rather than probing and constant tweaking. During this contest I found that the most interesting part was the cheating entries. For example, that way I learned how powerful dynamic regexps are. I did not learn anything from looking at the winning entry.</p>
<p>Like someone wrote in the newsgroup, another round of Matlab Golf would be great! It&#8217;s a lot of fun and you learn plenty about the Matlab language, syntax and functions you perhaps didn&#8217;t know about such as TRACE and KRON.</p>
<p>Another idea, perhaps even more useful, would be a series of pure optimization challenges. It could be similar to the golf contest only the point would be to write the fastest code that produces the correct solution &#8211; e.g. finds the longest palindrom in a string or &#8220;the heaviest box&#8221; of a matrix. Just use a similar but slightly different data set for the final evaluation of entries to make sure people can&#8217;t probe and then use lookup tables.</p>
]]></content:encoded>
	</item>
</channel>
</rss>

