<?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"
	>
<channel>
	<title>Comments on: Levy Walks</title>
	<atom:link href="http://enthusiasm.cozy.org/archives/2008/03/levy-walks/feed" rel="self" type="application/rss+xml" />
	<link>http://enthusiasm.cozy.org/archives/2008/03/levy-walks</link>
	<description>Ben Hyde</description>
	<pubDate>Wed, 08 Oct 2008 03:02:46 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.5.1</generator>
		<item>
		<title>By: Stefano&#8217;s Linotype &#187; Blog Archive &#187; On The Impact of Interruption on Creativity</title>
		<link>http://enthusiasm.cozy.org/archives/2008/03/levy-walks#comment-123704</link>
		<dc:creator>Stefano&#8217;s Linotype &#187; Blog Archive &#187; On The Impact of Interruption on Creativity</dc:creator>
		<pubDate>Sun, 13 Apr 2008 03:27:02 +0000</pubDate>
		<guid isPermaLink="false">http://enthusiasm.cozy.org/archives/2008/03/levy-walks/#comment-123704</guid>
		<description>[...] Here, it would be already interesting to discuss the various strategies that one could adopt to find such peak (hill climbing, brownian motion, levy flight, random waypoint) [see also Ben&#8217;s post on the subject]. [...]</description>
		<content:encoded><![CDATA[<p>[...] Here, it would be already interesting to discuss the various strategies that one could adopt to find such peak (hill climbing, brownian motion, levy flight, random waypoint) [see also Ben&#8217;s post on the subject]. [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Jason Brownlee</title>
		<link>http://enthusiasm.cozy.org/archives/2008/03/levy-walks#comment-120851</link>
		<dc:creator>Jason Brownlee</dc:creator>
		<pubDate>Thu, 27 Mar 2008 03:27:02 +0000</pubDate>
		<guid isPermaLink="false">http://enthusiasm.cozy.org/archives/2008/03/levy-walks/#comment-120851</guid>
		<description>"I don’t think I’ve ever saw seen a search algorithm using this method"

Ben, the approach is typically integrated into existing (as you call them 'weak') search methods as acceptance criteria for new solutions into a working set (population). For example, in a genetic algorithm or simulated annealing (&lt;a href="http://scholar.google.com/scholar?q=simulated+annealing+levy+flight" rel="nofollow"&gt;try this link&lt;/a&gt;). Hope this helps.</description>
		<content:encoded><![CDATA[<p>&#8220;I don’t think I’ve ever saw seen a search algorithm using this method&#8221;</p>
<p>Ben, the approach is typically integrated into existing (as you call them &#8216;weak&#8217;) search methods as acceptance criteria for new solutions into a working set (population). For example, in a genetic algorithm or simulated annealing (<a href="http://scholar.google.com/scholar?q=simulated+annealing+levy+flight" rel="nofollow">try this link</a>). Hope this helps.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
