<?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: Survey results out! &#8211; part 1</title>
	<atom:link href="http://www.rumblingedge.com/2007/11/21/survey-results-out-part-1/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.rumblingedge.com/2007/11/21/survey-results-out-part-1/</link>
	<description>Tracking developments in Mozilla Thunderbird builds</description>
	<lastBuildDate>Tue, 27 Jul 2010 13:36:15 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.0</generator>
	<item>
		<title>By: Anonymous</title>
		<link>http://www.rumblingedge.com/2007/11/21/survey-results-out-part-1/comment-page-1/#comment-1391</link>
		<dc:creator>Anonymous</dc:creator>
		<pubDate>Fri, 23 Nov 2007 14:43:17 +0000</pubDate>
		<guid isPermaLink="false">http://www.rumblingedge.com/?p=870#comment-1391</guid>
		<description>Thank you for running the voting algorithms; very interesting results!
</description>
		<content:encoded><![CDATA[<p>Thank you for running the voting algorithms; very interesting results!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Anonymous</title>
		<link>http://www.rumblingedge.com/2007/11/21/survey-results-out-part-1/comment-page-1/#comment-1390</link>
		<dc:creator>Anonymous</dc:creator>
		<pubDate>Thu, 22 Nov 2007 14:29:17 +0000</pubDate>
		<guid isPermaLink="false">http://www.rumblingedge.com/?p=870#comment-1390</guid>
		<description>Just averaging the ranks of options doesn&#039;t provide as much useful information as it could.  You have a set of ranked options; how about applying a voting algorithm such as Condorcet to it repeatedly, to obtain the most preferred choices?  The results may well differ.
</description>
		<content:encoded><![CDATA[<p>Just averaging the ranks of options doesn&#8217;t provide as much useful information as it could.  You have a set of ranked options; how about applying a voting algorithm such as Condorcet to it repeatedly, to obtain the most preferred choices?  The results may well differ.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Dan Mosedale</title>
		<link>http://www.rumblingedge.com/2007/11/21/survey-results-out-part-1/comment-page-1/#comment-1389</link>
		<dc:creator>Dan Mosedale</dc:creator>
		<pubDate>Thu, 22 Nov 2007 10:11:35 +0000</pubDate>
		<guid isPermaLink="false">http://www.rumblingedge.com/?p=870#comment-1389</guid>
		<description>This is fascinating; thanks for doing all this hard work!

Dan

</description>
		<content:encoded><![CDATA[<p>This is fascinating; thanks for doing all this hard work!</p>
<p>Dan</p>
]]></content:encoded>
	</item>
</channel>
</rss>

<!-- Dynamic Page Served (once) in 0.367 seconds -->
