<?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: The Soft Heap: An Approximate Priority Queue with Optimal Error Rate</title>
	<atom:link href="http://papersincomputerscience.org/2009/07/06/the-soft-heap-an-approximate-priority-queue-with-optimal-error-rate/feed/" rel="self" type="application/rss+xml" />
	<link>http://papersincomputerscience.org/2009/07/06/the-soft-heap-an-approximate-priority-queue-with-optimal-error-rate/</link>
	<description>Discussion of computer science publications</description>
	<lastBuildDate>Wed, 25 Jan 2012 11:32:47 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3.1</generator>
	<item>
		<title>By: Dominic</title>
		<link>http://papersincomputerscience.org/2009/07/06/the-soft-heap-an-approximate-priority-queue-with-optimal-error-rate/#comment-11537</link>
		<dc:creator>Dominic</dc:creator>
		<pubDate>Wed, 25 Jan 2012 11:32:47 +0000</pubDate>
		<guid isPermaLink="false">http://papersincomputerscience.org/?p=152#comment-11537</guid>
		<description>Thanks for this article! I&#039;ve been brainstorming on heuristic priority queues for a few days, but kept ending up with overly complex ideas with little practical promise. At first glance, this Soft Heap seems perfect for my problem. Can&#039;t wait to give it a try!</description>
		<content:encoded><![CDATA[<p>Thanks for this article! I&#8217;ve been brainstorming on heuristic priority queues for a few days, but kept ending up with overly complex ideas with little practical promise. At first glance, this Soft Heap seems perfect for my problem. Can&#8217;t wait to give it a try!</p>
]]></content:encoded>
	</item>
</channel>
</rss>

