<?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: Firefox Based Rank Checking Tool!</title>
	<atom:link href="http://www.pagetrafficbuzz.com/firefox-based-rank-checking-tool/4403/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.pagetrafficbuzz.com/firefox-based-rank-checking-tool/4403/</link>
	<description>Search engine news, SEO Tips, Google updates, SEO articles</description>
	<lastBuildDate>Tue, 07 Feb 2012 09:36:24 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.2.1</generator>
	<item>
		<title>By: cartouches d encre</title>
		<link>http://www.pagetrafficbuzz.com/firefox-based-rank-checking-tool/4403/comment-page-1/#comment-352082</link>
		<dc:creator>cartouches d encre</dc:creator>
		<pubDate>Tue, 01 Dec 2009 04:11:04 +0000</pubDate>
		<guid isPermaLink="false">http://www.pagetrafficbuzz.com/firefox-based-rank-checking-tool/4403/#comment-352082</guid>
		<description>This is amazing. I&#039;ve been using &#039;Free Monitor for Google&#039; for some time, and it does not have anywhere near the amount of features that your tool does. In your tool, I can deterministically pick a time before sending another request, but a better way of doing it I have found is to randomly generate wait times that are exponentially distributed there is a reason why I&#039;m using this distribution, the exponential distribution is &quot;memoryless&quot; distribution, so no correlation can ascertained between requests. </description>
		<content:encoded><![CDATA[<p>This is amazing. I&#039;ve been using &#039;Free Monitor for Google&#039; for some time, and it does not have anywhere near the amount of features that your tool does. In your tool, I can deterministically pick a time before sending another request, but a better way of doing it I have found is to randomly generate wait times that are exponentially distributed there is a reason why I&#039;m using this distribution, the exponential distribution is &quot;memoryless&quot; distribution, so no correlation can ascertained between requests.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: amelia</title>
		<link>http://www.pagetrafficbuzz.com/firefox-based-rank-checking-tool/4403/comment-page-1/#comment-348568</link>
		<dc:creator>amelia</dc:creator>
		<pubDate>Fri, 04 Apr 2008 04:51:16 +0000</pubDate>
		<guid isPermaLink="false">http://www.pagetrafficbuzz.com/firefox-based-rank-checking-tool/4403/#comment-348568</guid>
		<description>well this will stand as a good example tool for  checking our rank :) thanks for the info</description>
		<content:encoded><![CDATA[<p>well this will stand as a good example tool for  checking our rank <img src='http://www.pagetrafficbuzz.com/wp-includes/images/smilies/icon_smile.gif' alt=':)' class='wp-smiley' />  thanks for the info</p>
]]></content:encoded>
	</item>
</channel>
</rss>

