<?xml version="1.0" encoding="UTF-8"?>
<!-- generator="wordpress/wordpress-mu-1.2.3-2.2.1" -->
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	>

<channel>
	<title>Kumara Sastry</title>
	<link>http://www.illigal.uiuc.edu/web/kumara</link>
	<description>Member, Illinois Genetic Algorithms Laboratory</description>
	<pubDate>Sun, 22 Jul 2007 02:56:30 +0000</pubDate>
	<generator>http://wordpress.org/?v=wordpress-mu-1.2.3-2.2.1</generator>
	<language>en</language>
			<item>
		<title>Moved to my new webpage: www.kumarasastry.com</title>
		<link>http://www.illigal.uiuc.edu/web/kumara/2007/07/21/moved-to-my-new-webpage-wwwkumarasastrycom/</link>
		<comments>http://www.illigal.uiuc.edu/web/kumara/2007/07/21/moved-to-my-new-webpage-wwwkumarasastrycom/#comments</comments>
		<pubDate>Sun, 22 Jul 2007 02:56:30 +0000</pubDate>
		<dc:creator>Kumara Sastry</dc:creator>
		
		<category><![CDATA[Interesting Finds]]></category>

		<category><![CDATA[Movies/DVDs]]></category>

		<category><![CDATA[Photos]]></category>

		<category><![CDATA[Presentations]]></category>

		<category><![CDATA[Publications]]></category>

		<guid isPermaLink="false">http://www.illigal.uiuc.edu/web/kumara/2007/07/21/moved-to-my-new-webpage-wwwkumarasastrycom/</guid>
		<description><![CDATA[I moved my homepage over to www.kumarasastry.com. I was planning this move for sometime now and finally did it.
]]></description>
			<content:encoded><![CDATA[<p>I moved my homepage over to <a href="http://www.kumarasastry.com">www.kumarasastry.com</a>. I was planning this move for sometime now and finally did it.</p>
]]></content:encoded>
			<wfw:commentRss>http://www.illigal.uiuc.edu/web/kumara/2007/07/21/moved-to-my-new-webpage-wwwkumarasastrycom/feed/</wfw:commentRss>
		</item>
		<item>
		<title>1000 films to watch before you die</title>
		<link>http://www.illigal.uiuc.edu/web/kumara/2007/07/15/1000-films-to-watch-before-you-die/</link>
		<comments>http://www.illigal.uiuc.edu/web/kumara/2007/07/15/1000-films-to-watch-before-you-die/#comments</comments>
		<pubDate>Sun, 15 Jul 2007 22:30:47 +0000</pubDate>
		<dc:creator>Kumara Sastry</dc:creator>
		
		<category><![CDATA[Interesting Finds]]></category>

		<category><![CDATA[Movies/DVDs]]></category>

		<guid isPermaLink="false">http://www.illigal.uiuc.edu/web/kumara/2007/07/15/1000-films-to-watch-before-you-die/</guid>
		<description><![CDATA[Found this guardian article via meish.org. Here is my breakdown (yes working on your thesis makes you spend time on such silly things), and I was surprised to see that I&#8217;ve only watched 301 out of the 1000 movies, but frankly most of them don&#8217;t seem to be any good. For example, Ace ventura is [...]]]></description>
			<content:encoded><![CDATA[<p>Found this <a href="http://film.guardian.co.uk/1000films/">guardian article</a> via <a href="http://meish.org/2007/06/29/a-couple-of-things/">meish.org</a>. Here is my breakdown (yes working on your thesis makes you spend time on such silly things), and I was surprised to see that I&#8217;ve only watched 301 out of the 1000 movies, but frankly most of them don&#8217;t seem to be any good. For example, Ace ventura is one of the 1000 movies!</p>
<table>
<tr>
<td><strong>A:</strong> 13 out of 54</td>
<td><strong>B:</strong> 24 out of 95</td>
<td><strong>C:</strong> 15 out of 61</td>
<td><strong>D:</strong> 20 out of 64</td>
</tr>
<tr>
<td><strong>E:</strong> 8 out of 25</td>
<td><strong>F:</strong> 11 out of 36</td>
<td><strong>G:</strong> 18 out of 47</td>
<td><strong>H:</strong> 5 out of 45</td>
</tr>
<tr>
<td><strong>I:</strong> 8 out of 30</td>
<td><strong>J:</strong> 6 out of 14</td>
<td><strong>K:</strong> 7 out of 22</td>
<td><strong>L:</strong> 16 out of 50</td>
</tr>
<tr>
<td><strong>M:</strong> 27 out of 71</td>
<td><strong>N:</strong> 4 out of 24</td>
<td><strong>O:</strong> 11 out of 28</td>
<td><strong>P:</strong> 19 out of 46</td>
</tr>
<tr>
<td><strong>Q:</strong> 1 out of 2</td>
<td><strong>R:</strong> 16 out of 42</td>
<td><strong>S:</strong> 32 out of 101</td>
<td><strong>T:</strong> 24 out of 67</td>
</tr>
<tr>
<td><strong>U:</strong> 3 out of 9</td>
<td><strong>V:</strong> 1 out of 12</td>
<td><strong>W:</strong> 7 out of 35</td>
<td><strong>X:</strong> 1 out of 2</td>
</tr>
<tr>
<td><strong>Y:</strong> 2 out of 8</td>
<td><strong>Z:</strong> 2 out of 6</td>
<td>&nbsp;</td>
<td>&nbsp;</td>
</tr>
</table>
<p><em>Update:</em> The sum doesn&#8217;t add up to 1000, I am missing 4 movies somewhere.</p>
]]></content:encoded>
			<wfw:commentRss>http://www.illigal.uiuc.edu/web/kumara/2007/07/15/1000-films-to-watch-before-you-die/feed/</wfw:commentRss>
		</item>
		<item>
		<title>GECCO-2007@London photos</title>
		<link>http://www.illigal.uiuc.edu/web/kumara/2007/07/14/gecco-2007london-photos/</link>
		<comments>http://www.illigal.uiuc.edu/web/kumara/2007/07/14/gecco-2007london-photos/#comments</comments>
		<pubDate>Sat, 14 Jul 2007 18:34:09 +0000</pubDate>
		<dc:creator>Kumara Sastry</dc:creator>
		
		<category><![CDATA[Photos]]></category>

		<guid isPermaLink="false">http://www.illigal.uiuc.edu/web/kumara/2007/07/14/gecco-2007london-photos/</guid>
		<description><![CDATA[
See the slideshow at Flickr.com
]]></description>
			<content:encoded><![CDATA[<p><iframe align=center src=http://www.flickr.com/slideShow/index.gne?user_id=89044848@N00&set_id=72157600770450400 frameBorder=0 width=500 scrolling=no height=500></iframe></p>
<p><a href="http://www.flickr.com/photos/kumarasastry/sets/72157600770450400/show/">See the slideshow at Flickr.com</a></p>
]]></content:encoded>
			<wfw:commentRss>http://www.illigal.uiuc.edu/web/kumara/2007/07/14/gecco-2007london-photos/feed/</wfw:commentRss>
		</item>
		<item>
		<title>Towards billion bit optimization via parallel estimation of distribution algorithm</title>
		<link>http://www.illigal.uiuc.edu/web/kumara/2007/07/14/towards-billion-bit-optimization-via-parallel-estimation-of-distribution-algorithm/</link>
		<comments>http://www.illigal.uiuc.edu/web/kumara/2007/07/14/towards-billion-bit-optimization-via-parallel-estimation-of-distribution-algorithm/#comments</comments>
		<pubDate>Sat, 14 Jul 2007 14:49:00 +0000</pubDate>
		<dc:creator>Kumara Sastry</dc:creator>
		
		<category><![CDATA[Principled Efficiency Enhancement Techniques]]></category>

		<category><![CDATA[Competent GAs]]></category>

		<category><![CDATA[Genetic and Evolutionary Algorithm Theory]]></category>

		<category><![CDATA[Conference Proceedings]]></category>

		<category><![CDATA[Publications]]></category>

		<category><![CDATA[Estimation of Distribution Algorithms]]></category>

		<guid isPermaLink="false">http://www.illigal.uiuc.edu/web/kumara/2007/07/14/towards-billion-bit-optimization-via-parallel-estimation-of-distribution-algorithm/</guid>
		<description><![CDATA[Sastry, K., Goldberg, D. E., Llor&#224;, X. (2007). Proceedings of the 2007 Genetic and Evolutionary Computation Conference (GECCO 2007). 577&#8211;584. [Best paper in Estimation of Distribution Algorithms track] [Preprint: IlliGAL report no. 2007007] [Full paper - DOI] [Presentation Slides].

]]></description>
			<content:encoded><![CDATA[<p>Sastry, K., Goldberg, D. E., Llor&agrave;, X. (2007). <em>Proceedings of the 2007 Genetic and Evolutionary Computation Conference (GECCO 2007)</em>. 577&ndash;584. [<strong>Best paper in Estimation of Distribution Algorithms track</strong>] [<a>Preprint: IlliGAL report no. 2007007</a>] [<a href="http://doi.acm.org/10.1145/1276958.1277077">Full paper - DOI</a>] [<a href="http://www.slideshare.net/kknsastry/towards-billion-bit-optimization-via-parallel-estimation-of-distribution-algorithm/download">Presentation Slides</a>].</p>
<p><object type=application/x-shockwave-flash data=https://s3.amazonaws.com:443/slideshare/ssplayer.swf?id=77764&doc=towards-billion-bit-optimization-via-parallel-estimation-of-distribution-algorithm1292 width=425 height=348><param name=movie value=https://s3.amazonaws.com:443/slideshare/ssplayer.swf?id=77764&doc=towards-billion-bit-optimization-via-parallel-estimation-of-distribution-algorithm1292 /></object></p>
]]></content:encoded>
			<wfw:commentRss>http://www.illigal.uiuc.edu/web/kumara/2007/07/14/towards-billion-bit-optimization-via-parallel-estimation-of-distribution-algorithm/feed/</wfw:commentRss>
		</item>
		<item>
		<title>Empirical Analysis of ideal recombination on random decomposable problems</title>
		<link>http://www.illigal.uiuc.edu/web/kumara/2007/07/14/empirical-analysis-of-ideal-recombination-on-random-decomposable-problems/</link>
		<comments>http://www.illigal.uiuc.edu/web/kumara/2007/07/14/empirical-analysis-of-ideal-recombination-on-random-decomposable-problems/#comments</comments>
		<pubDate>Sat, 14 Jul 2007 14:36:06 +0000</pubDate>
		<dc:creator>Kumara Sastry</dc:creator>
		
		<category><![CDATA[Genetic and Evolutionary Algorithm Theory]]></category>

		<category><![CDATA[Genetic and Evolutionary Algorithms]]></category>

		<category><![CDATA[Conference Proceedings]]></category>

		<category><![CDATA[Publications]]></category>

		<guid isPermaLink="false">http://www.illigal.uiuc.edu/web/kumara/2007/07/14/empirical-analysis-of-ideal-recombination-on-random-decomposable-problems/</guid>
		<description><![CDATA[Sastry, K., Pelikan, M., Goldberg, D. E. (2007). Proceedings of the 2007 Genetic and Evolutionary Computation Conference (GECCO 2007). 1388&#8211;1395. [Nominated for best paper in Genetic Algorithms track] [Preprint: IlliGAL report no. 2006016] [Full paper - DOI] [Presentation slides].

]]></description>
			<content:encoded><![CDATA[<p>Sastry, K., Pelikan, M., Goldberg, D. E. (2007). <em>Proceedings of the 2007 Genetic and Evolutionary Computation Conference (GECCO 2007)</em>. 1388&ndash;1395. [<strong>Nominated for best paper in Genetic Algorithms track</strong>] [<a href="http://www.illigal.uiuc.edu/pub/papers/IlliGALs/2006016.pdf">Preprint: IlliGAL report no. 2006016</a>] [<a href="http://doi.acm.org/10.1145/1276958.1277216">Full paper - DOI</a>] [<a href="http://www.slideshare.net/kknsastry/empirical-analysis-of-ideal-recombination-on-random-decomposable-problems/download">Presentation slides</a>].</p>
<p><object type=application/x-shockwave-flash data=https://s3.amazonaws.com:443/slideshare/ssplayer.swf?id=77761&doc=empirical-analysis-of-ideal-recombination-on-random-decomposable-problems3122 width=425 height=348><param name=movie value=https://s3.amazonaws.com:443/slideshare/ssplayer.swf?id=77761&doc=empirical-analysis-of-ideal-recombination-on-random-decomposable-problems3122 /></object></p>
]]></content:encoded>
			<wfw:commentRss>http://www.illigal.uiuc.edu/web/kumara/2007/07/14/empirical-analysis-of-ideal-recombination-on-random-decomposable-problems/feed/</wfw:commentRss>
		</item>
		<item>
		<title>Automated alphabet reduction method with evolutionary algorithms for protein structure prediction</title>
		<link>http://www.illigal.uiuc.edu/web/kumara/2007/07/14/automated-alphabet-reduction-method-with-evolutionary-algorithms-for-protein-structure-prediction/</link>
		<comments>http://www.illigal.uiuc.edu/web/kumara/2007/07/14/automated-alphabet-reduction-method-with-evolutionary-algorithms-for-protein-structure-prediction/#comments</comments>
		<pubDate>Sat, 14 Jul 2007 14:24:26 +0000</pubDate>
		<dc:creator>Kumara Sastry</dc:creator>
		
		<category><![CDATA[Competent GAs]]></category>

		<category><![CDATA[Genetics Based Machine Learning]]></category>

		<category><![CDATA[Conference Proceedings]]></category>

		<category><![CDATA[Publications]]></category>

		<category><![CDATA[Estimation of Distribution Algorithms]]></category>

		<guid isPermaLink="false">http://www.illigal.uiuc.edu/web/kumara/2007/07/14/automated-alphabet-reduction-method-with-evolutionary-algorithms-for-protein-structure-prediction/</guid>
		<description><![CDATA[Bacardit, J., Stout, M., Hirst, J. D., Sastry, K., Llor&#224;, X., Krasnogor, N. (2007). Proceedings of the 2007 Genetic and Evolutionary Computation Conference (GECCO 2007). 346&#8211;353. [Bronze &#8220;Humies&#8221; award at the Human Competitive Results Competition] [Preprint: IlliGAL report no. 2007015] [Full paper - DOI].
]]></description>
			<content:encoded><![CDATA[<p>Bacardit, J., Stout, M., Hirst, J. D., Sastry, K., Llor&agrave;, X., Krasnogor, N. (2007). <em>Proceedings of the 2007 Genetic and Evolutionary Computation Conference (GECCO 2007)</em>. 346&ndash;353. [<strong>Bronze &#8220;Humies&#8221; award at the <a href="http://www.genetic-programming.org/hc2007/cfe2007.html">Human Competitive Results Competition</a></strong>] [<a href="http://www.illigal.uiuc.edu/pub/papers/IlliGALs/2007015.pdf">Preprint: IlliGAL report no. 2007015</a>] [<a href="http://doi.acm.org/10.1145/1276958.1277033">Full paper - DOI</a>].</p>
]]></content:encoded>
			<wfw:commentRss>http://www.illigal.uiuc.edu/web/kumara/2007/07/14/automated-alphabet-reduction-method-with-evolutionary-algorithms-for-protein-structure-prediction/feed/</wfw:commentRss>
		</item>
		<item>
		<title>Population sizing for entropy-based model building in genetic algorithms</title>
		<link>http://www.illigal.uiuc.edu/web/kumara/2007/07/14/population-sizing-for-entropy-based-model-building-in-genetic-algorithms-2/</link>
		<comments>http://www.illigal.uiuc.edu/web/kumara/2007/07/14/population-sizing-for-entropy-based-model-building-in-genetic-algorithms-2/#comments</comments>
		<pubDate>Sat, 14 Jul 2007 14:15:10 +0000</pubDate>
		<dc:creator>Kumara Sastry</dc:creator>
		
		<category><![CDATA[Genetic and Evolutionary Algorithm Theory]]></category>

		<category><![CDATA[Conference Proceedings]]></category>

		<category><![CDATA[Publications]]></category>

		<category><![CDATA[Estimation of Distribution Algorithms]]></category>

		<guid isPermaLink="false">http://www.illigal.uiuc.edu/web/kumara/2007/07/14/population-sizing-for-entropy-based-model-building-in-genetic-algorithms-2/</guid>
		<description><![CDATA[Yu, T.-L., Sastry, K., Goldberg, D. E., Pelikan, M. (2007). Proceedings of the 2007 Genetic and Evolutionary Computation Conference (GECCO 2007). 601&#8211;608. [Nominated for the best paper award in Estimation of Distribution Algorithms track] [Preprint: IlliGAL report no. 2006020] [Full paper - DOI] [Presentation slides].

]]></description>
			<content:encoded><![CDATA[<p>Yu, T.-L., Sastry, K., Goldberg, D. E., Pelikan, M. (2007). <em>Proceedings of the 2007 Genetic and Evolutionary Computation Conference (GECCO 2007)</em>. 601&ndash;608. [<strong>Nominated for the best paper award in Estimation of Distribution Algorithms track</strong>] [<a href="http://www.illigal.uiuc.edu/pub/papers/IlliGALs/2006020.pdf">Preprint: IlliGAL report no. 2006020</a>] [<a href="http://doi.acm.org/10.1145/1276958.1277080">Full paper - DOI</a>] [<a href="http://www.slideshare.net/kknsastry/population-sizing-for-entropybased-model-buliding-in-genetic-algorithms/download">Presentation slides</a>].</p>
<p><object type=application/x-shockwave-flash data=https://s3.amazonaws.com:443/slideshare/ssplayer.swf?id=77752&doc=population-sizing-for-entropybased-model-buliding-in-genetic-algorithms2125 width=425 height=348><param name=movie value=https://s3.amazonaws.com:443/slideshare/ssplayer.swf?id=77752&doc=population-sizing-for-entropybased-model-buliding-in-genetic-algorithms2125 /></object></p>
]]></content:encoded>
			<wfw:commentRss>http://www.illigal.uiuc.edu/web/kumara/2007/07/14/population-sizing-for-entropy-based-model-building-in-genetic-algorithms-2/feed/</wfw:commentRss>
		</item>
		<item>
		<title>Let&#8217;s get ready to rumble redux: Crossover versus mutation head to head on exponentially scaled problems</title>
		<link>http://www.illigal.uiuc.edu/web/kumara/2007/07/13/lets-get-ready-to-rumble-redux-crossover-versus-mutation-head-to-head-on-exponentially-scaled-problems-2/</link>
		<comments>http://www.illigal.uiuc.edu/web/kumara/2007/07/13/lets-get-ready-to-rumble-redux-crossover-versus-mutation-head-to-head-on-exponentially-scaled-problems-2/#comments</comments>
		<pubDate>Sat, 14 Jul 2007 03:06:50 +0000</pubDate>
		<dc:creator>Kumara Sastry</dc:creator>
		
		<category><![CDATA[Principled Efficiency Enhancement Techniques]]></category>

		<category><![CDATA[Genetic and Evolutionary Algorithm Theory]]></category>

		<category><![CDATA[Genetic and Evolutionary Algorithms]]></category>

		<category><![CDATA[Conference Proceedings]]></category>

		<category><![CDATA[Publications]]></category>

		<guid isPermaLink="false">http://www.illigal.uiuc.edu/web/kumara/2007/07/13/lets-get-ready-to-rumble-redux-crossover-versus-mutation-head-to-head-on-exponentially-scaled-problems-2/</guid>
		<description><![CDATA[Sastry, K., Goldberg, D. E. (2007). Proceedings of the 2007 Genetic and Evolutionary Computation Conference (GECCO 2007). 1380&#8211;1387. [Preprint: IlliGAL report no. 2007005] [Full paper - DOI] [Presentation slides].

]]></description>
			<content:encoded><![CDATA[<p>Sastry, K., Goldberg, D. E. (2007). <em>Proceedings of the 2007 Genetic and Evolutionary Computation Conference (GECCO 2007)</em>. 1380&ndash;1387. [<a>Preprint: IlliGAL report no. 2007005</a>] [<a href="http://doi.acm.org/10.1145/1276958.1277215">Full paper - DOI</a>] [<a href="http://www.slideshare.net/kknsastry/lets-get-ready-to-rumble-redux-crossover-versus-mutation-head-to-head-on-exponentially-scaled-problems-77662/download">Presentation slides</a>].</p>
<p><object type=application/x-shockwave-flash data=https://s3.amazonaws.com:443/slideshare/ssplayer.swf?id=77662&doc=lets-get-ready-to-rumble-redux-crossover-versus-mutation-head-to-head-on-exponentially-scaled-problems1687 width=425 height=348><param name=movie value=https://s3.amazonaws.com:443/slideshare/ssplayer.swf?id=77662&doc=lets-get-ready-to-rumble-redux-crossover-versus-mutation-head-to-head-on-exponentially-scaled-problems1687 /></object></p>
]]></content:encoded>
			<wfw:commentRss>http://www.illigal.uiuc.edu/web/kumara/2007/07/13/lets-get-ready-to-rumble-redux-crossover-versus-mutation-head-to-head-on-exponentially-scaled-problems-2/feed/</wfw:commentRss>
		</item>
		<item>
		<title>Modeling selection pressure in XCS for proportionate and tournament selection</title>
		<link>http://www.illigal.uiuc.edu/web/kumara/2007/07/13/modeling-selection-pressure-in-xcs-for-proportionate-and-tournament-selection-2/</link>
		<comments>http://www.illigal.uiuc.edu/web/kumara/2007/07/13/modeling-selection-pressure-in-xcs-for-proportionate-and-tournament-selection-2/#comments</comments>
		<pubDate>Sat, 14 Jul 2007 02:15:34 +0000</pubDate>
		<dc:creator>Kumara Sastry</dc:creator>
		
		<category><![CDATA[Genetics Based Machine Learning]]></category>

		<category><![CDATA[Genetic and Evolutionary Algorithm Theory]]></category>

		<category><![CDATA[Conference Proceedings]]></category>

		<category><![CDATA[Publications]]></category>

		<guid isPermaLink="false">http://www.illigal.uiuc.edu/web/kumara/2007/07/13/modeling-selection-pressure-in-xcs-for-proportionate-and-tournament-selection-2/</guid>
		<description><![CDATA[Orriols-Puig, A., Sastry, K., Lanzi, P. L., Goldberg, D. E., Bernad&#243;-Mansilla, E. (2007). Proceedings of the 2007 Genetic and Evolutionary Computation Conference (GECCO 2007). 1846&#8211;1853. [Preprint: IlliGAL report no. 2007004] [Full paper - DOI] [Presentation slides].

]]></description>
			<content:encoded><![CDATA[<p>Orriols-Puig, A., Sastry, K., Lanzi, P. L., Goldberg, D. E., Bernad&oacute;-Mansilla, E. (2007). <em>Proceedings of the 2007 Genetic and Evolutionary Computation Conference (GECCO 2007)</em>. 1846&ndash;1853. [<a href="http://www.illigal.uiuc.edu/pub/papers/IlliGALs/2007004.pdf">Preprint: IlliGAL report no. 2007004</a>] [<a href="http://doi.acm.org/10.1145/1276958.1277325">Full paper - DOI</a>] [<a href="http://www.slideshare.net/kknsastry/modeling-selection-pressure-in-xcs-for-proportionate-and-tournament-selection-77652/download">Presentation slides</a>].</p>
<p><object type=application/x-shockwave-flash data=https://s3.amazonaws.com:443/slideshare/ssplayer.swf?id=77652&doc=modeling-selection-pressure-in-xcs-for-proportionate-and-tournament-selection355 width=425 height=348><param name=movie value=https://s3.amazonaws.com:443/slideshare/ssplayer.swf?id=77652&doc=modeling-selection-pressure-in-xcs-for-proportionate-and-tournament-selection355 /></object></p>
]]></content:encoded>
			<wfw:commentRss>http://www.illigal.uiuc.edu/web/kumara/2007/07/13/modeling-selection-pressure-in-xcs-for-proportionate-and-tournament-selection-2/feed/</wfw:commentRss>
		</item>
		<item>
		<title>Do not match, Inherit: Fitness surrogates for genetics-based machine learning techniques</title>
		<link>http://www.illigal.uiuc.edu/web/kumara/2007/07/13/do-not-match-inherit-fitness-surrogates-for-genetics-based-machine-learning-techniques-2/</link>
		<comments>http://www.illigal.uiuc.edu/web/kumara/2007/07/13/do-not-match-inherit-fitness-surrogates-for-genetics-based-machine-learning-techniques-2/#comments</comments>
		<pubDate>Sat, 14 Jul 2007 01:59:55 +0000</pubDate>
		<dc:creator>Kumara Sastry</dc:creator>
		
		<category><![CDATA[Genetics Based Machine Learning]]></category>

		<category><![CDATA[Principled Efficiency Enhancement Techniques]]></category>

		<category><![CDATA[Conference Proceedings]]></category>

		<category><![CDATA[Publications]]></category>

		<category><![CDATA[Estimation of Distribution Algorithms]]></category>

		<guid isPermaLink="false">http://www.illigal.uiuc.edu/web/kumara/2007/07/13/do-not-match-inherit-fitness-surrogates-for-genetics-based-machine-learning-techniques-2/</guid>
		<description><![CDATA[Llor&#224;, X., Sastry, K., Yu, T.-L., Goldberg, D. E. (2007). Proceedings of the 2007 Genetic and Evolutionary Computation Conference (GECCO 2007). 1798&#8211;1805. [Preprint: IlliGAL report no. 2007011] [Full paper - DOI] [Presentation slides].

]]></description>
			<content:encoded><![CDATA[<p>Llor&agrave;, X., Sastry, K., Yu, T.-L., Goldberg, D. E. (2007). <em>Proceedings of the 2007 Genetic and Evolutionary Computation Conference (GECCO 2007)</em>. 1798&ndash;1805. [<a href="http://www.illigal.uiuc.edu/pub/papers/IlliGALs/2007011.pdf">Preprint: IlliGAL report no. 2007011</a>] [<a href="http://doi.acm.org/10.1145/1276958.1277319">Full paper - DOI</a>] [<a href="http://www.slideshare.net/xllora/do-not-match-inherit-fitness-surrogates-for-geneticsbased-machine-learning-techniques/download">Presentation slides</a>].</p>
<p><object type=application/x-shockwave-flash data=https://s3.amazonaws.com:443/slideshare/ssplayer.swf?id=79102&doc=do-not-match-inherit-fitness-surrogates-for-geneticsbased-machine-learning-techniques4969 width=425 height=348><param name=movie value=https://s3.amazonaws.com:443/slideshare/ssplayer.swf?id=79102&doc=do-not-match-inherit-fitness-surrogates-for-geneticsbased-machine-learning-techniques4969 /></object></p>
]]></content:encoded>
			<wfw:commentRss>http://www.illigal.uiuc.edu/web/kumara/2007/07/13/do-not-match-inherit-fitness-surrogates-for-genetics-based-machine-learning-techniques-2/feed/</wfw:commentRss>
		</item>
	</channel>
</rss>
