<?xml version="1.0" encoding="UTF-8"?>
<!-- generator="wordpress/2.3.3" -->
<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 &#187; Genetic and Evolutionary Algorithm Theory</title>
	<link>http://www.kumarasastry.com</link>
	<description></description>
	<pubDate>Mon, 05 May 2008 05:04:12 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.3.3</generator>
	<language>en</language>
			<item>
		<title>Towards billion bit optimization via parallel estimation of distribution algorithm</title>
		<link>http://www.kumarasastry.com/2007/07/14/towards-billion-bit-optimization-via-parallel-estimation-of-distribution-algorithm/</link>
		<comments>http://www.kumarasastry.com/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[Competent GAs]]></category>

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

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

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

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

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

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

		<category><![CDATA[billion-bit]]></category>

		<category><![CDATA[billion-variable]]></category>

		<category><![CDATA[compact-genetic-algorithm]]></category>

		<category><![CDATA[gecco-2007]]></category>

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

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

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

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

		<guid isPermaLink="false">http://kumarasastry.com/?p=277</guid>
		<description><![CDATA[Sastry, K., Goldberg, D. E., Llorà, X. (2007). Proceedings of the 2007 Genetic and Evolutionary Computation Conference (GECCO 2007). 577–584. [Best paper in Estimation of Distribution Algorithms track] [Preprint: IlliGAL report no. 2007007] [Full paper - DOI] [Presentation Slides].



<script type="text/javascript">
SHARETHIS.addEntry({
	title: "Towards billion bit optimization via parallel estimation of distribution algorithm",
	url: "http://www.kumarasastry.com/2007/07/14/towards-billion-bit-optimization-via-parallel-estimation-of-distribution-algorithm/"
});
</script>
	]]></description>
			<content:encoded><![CDATA[<p>Sastry, K., Goldberg, D. E., Llorà, X. (2007). <em>Proceedings of the 2007 Genetic and Evolutionary Computation Conference (GECCO 2007)</em>. 577–584. [<strong>Best paper in Estimation of Distribution Algorithms track</strong>] [Preprint: IlliGAL report no. 2007007] [<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>
<p><a href="http://sharethis.com/item?publisher=d273ea37-cd14-46b1-8ffd-38871863f07e&title=Towards+billion+bit+optimization+via+parallel+estimation+of+distribution+algorithm&url=http%3A%2F%2Fwww.kumarasastry.com%2F2007%2F07%2F14%2Ftowards-billion-bit-optimization-via-parallel-estimation-of-distribution-algorithm%2F">ShareThis</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.kumarasastry.com/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.kumarasastry.com/2007/07/14/empirical-analysis-of-ideal-recombination-on-random-decomposable-problems/</link>
		<comments>http://www.kumarasastry.com/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[Conference Proceedings]]></category>

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

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

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

		<category><![CDATA[convergence-time]]></category>

		<category><![CDATA[gecco-2007]]></category>

		<category><![CDATA[ideal-recombination]]></category>

		<category><![CDATA[population-sizing]]></category>

		<category><![CDATA[random-decomposable-problems]]></category>

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

		<guid isPermaLink="false">http://kumarasastry.com/?p=276</guid>
		<description><![CDATA[Sastry, K., Pelikan, M., Goldberg, D. E. (2007). Proceedings of the 2007 Genetic and Evolutionary Computation Conference (GECCO 2007). 1388–1395. [Nominated for best paper in Genetic Algorithms track] [Preprint: IlliGAL report no. 2006016] [Full paper - DOI] [Presentation slides].



<script type="text/javascript">
SHARETHIS.addEntry({
	title: "Empirical Analysis of ideal recombination on random decomposable problems",
	url: "http://www.kumarasastry.com/2007/07/14/empirical-analysis-of-ideal-recombination-on-random-decomposable-problems/"
});
</script>
	]]></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–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>
<p><a href="http://sharethis.com/item?publisher=d273ea37-cd14-46b1-8ffd-38871863f07e&title=Empirical+Analysis+of+ideal+recombination+on+random+decomposable+problems&url=http%3A%2F%2Fwww.kumarasastry.com%2F2007%2F07%2F14%2Fempirical-analysis-of-ideal-recombination-on-random-decomposable-problems%2F">ShareThis</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.kumarasastry.com/2007/07/14/empirical-analysis-of-ideal-recombination-on-random-decomposable-problems/feed/</wfw:commentRss>
		</item>
		<item>
		<title>Population sizing for entropy-based model building in genetic algorithms</title>
		<link>http://www.kumarasastry.com/2007/07/14/population-sizing-for-entropy-based-model-building-in-genetic-algorithms-2/</link>
		<comments>http://www.kumarasastry.com/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[Conference Proceedings]]></category>

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

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

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

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

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

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

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

		<category><![CDATA[facetwise-model]]></category>

		<category><![CDATA[gecco-2007]]></category>

		<category><![CDATA[mutual-information]]></category>

		<category><![CDATA[population-sizing]]></category>

		<guid isPermaLink="false">http://kumarasastry.com/?p=274</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–608. [Nominated for the best paper award in Estimation of Distribution Algorithms track] [Preprint: IlliGAL report no. 2006020] [Full paper - DOI] [Presentation slides].



<script type="text/javascript">
SHARETHIS.addEntry({
	title: "Population sizing for entropy-based model building in genetic algorithms",
	url: "http://www.kumarasastry.com/2007/07/14/population-sizing-for-entropy-based-model-building-in-genetic-algorithms-2/"
});
</script>
	]]></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–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>
<p><a href="http://sharethis.com/item?publisher=d273ea37-cd14-46b1-8ffd-38871863f07e&title=Population+sizing+for+entropy-based+model+building+in+genetic+algorithms&url=http%3A%2F%2Fwww.kumarasastry.com%2F2007%2F07%2F14%2Fpopulation-sizing-for-entropy-based-model-building-in-genetic-algorithms-2%2F">ShareThis</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.kumarasastry.com/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.kumarasastry.com/2007/07/13/lets-get-ready-to-rumble-redux-crossover-versus-mutation-head-to-head-on-exponentially-scaled-problems-2/</link>
		<comments>http://www.kumarasastry.com/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[Conference Proceedings]]></category>

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

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

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

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

		<category><![CDATA[gecco-2007]]></category>

		<category><![CDATA[ideal-mutation]]></category>

		<category><![CDATA[ideal-recombination]]></category>

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

		<category><![CDATA[problem-difficulty]]></category>

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

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

		<guid isPermaLink="false">http://kumarasastry.com/?p=273</guid>
		<description><![CDATA[Sastry, K., Goldberg, D. E. (2007). Proceedings of the 2007 Genetic and Evolutionary Computation Conference (GECCO 2007). 1380–1387. [Preprint: IlliGAL report no. 2007005] [Full paper - DOI] [Presentation slides].



<script type="text/javascript">
SHARETHIS.addEntry({
	title: "Let&#8217;s get ready to rumble redux: Crossover versus mutation head to head on exponentially scaled problems",
	url: "http://www.kumarasastry.com/2007/07/13/lets-get-ready-to-rumble-redux-crossover-versus-mutation-head-to-head-on-exponentially-scaled-problems-2/"
});
</script>
	]]></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–1387. [Preprint: IlliGAL report no. 2007005] [<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>
<p><a href="http://sharethis.com/item?publisher=d273ea37-cd14-46b1-8ffd-38871863f07e&title=Let%26%238217%3Bs+get+ready+to+rumble+redux%3A+Crossover+versus+mutation+head+to+head+on+exponentially+scaled+problems&url=http%3A%2F%2Fwww.kumarasastry.com%2F2007%2F07%2F13%2Flets-get-ready-to-rumble-redux-crossover-versus-mutation-head-to-head-on-exponentially-scaled-problems-2%2F">ShareThis</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.kumarasastry.com/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.kumarasastry.com/2007/07/13/modeling-selection-pressure-in-xcs-for-proportionate-and-tournament-selection-2/</link>
		<comments>http://www.kumarasastry.com/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[Conference Proceedings]]></category>

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

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

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

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

		<category><![CDATA[gecco-2007]]></category>

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

		<category><![CDATA[machine-learning]]></category>

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

		<category><![CDATA[takeover-time]]></category>

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

		<guid isPermaLink="false">http://kumarasastry.com/?p=272</guid>
		<description><![CDATA[Orriols-Puig, A., Sastry, K., Lanzi, P. L., Goldberg, D. E., Bernadó-Mansilla, E. (2007). Proceedings of the 2007 Genetic and Evolutionary Computation Conference (GECCO 2007). 1846–1853. [Preprint: IlliGAL report no. 2007004] [Full paper - DOI] [Presentation slides].



<script type="text/javascript">
SHARETHIS.addEntry({
	title: "Modeling selection pressure in XCS for proportionate and tournament selection",
	url: "http://www.kumarasastry.com/2007/07/13/modeling-selection-pressure-in-xcs-for-proportionate-and-tournament-selection-2/"
});
</script>
	]]></description>
			<content:encoded><![CDATA[<p>Orriols-Puig, A., Sastry, K., Lanzi, P. L., Goldberg, D. E., Bernadó-Mansilla, E. (2007). <em>Proceedings of the 2007 Genetic and Evolutionary Computation Conference (GECCO 2007)</em>. 1846–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>
<p><a href="http://sharethis.com/item?publisher=d273ea37-cd14-46b1-8ffd-38871863f07e&title=Modeling+selection+pressure+in+XCS+for+proportionate+and+tournament+selection&url=http%3A%2F%2Fwww.kumarasastry.com%2F2007%2F07%2F13%2Fmodeling-selection-pressure-in-xcs-for-proportionate-and-tournament-selection-2%2F">ShareThis</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.kumarasastry.com/2007/07/13/modeling-selection-pressure-in-xcs-for-proportionate-and-tournament-selection-2/feed/</wfw:commentRss>
		</item>
		<item>
		<title>Modeling XCS in class imbalances: Population sizing and parameter settings</title>
		<link>http://www.kumarasastry.com/2007/07/13/modeling-xcs-in-class-imbalances-population-sizing-and-parameter-settings/</link>
		<comments>http://www.kumarasastry.com/2007/07/13/modeling-xcs-in-class-imbalances-population-sizing-and-parameter-settings/#comments</comments>
		<pubDate>Sat, 14 Jul 2007 01:45:32 +0000</pubDate>
		<dc:creator>Kumara Sastry</dc:creator>
		
		<category><![CDATA[Conference Proceedings]]></category>

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

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

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

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

		<category><![CDATA[gecco-2007]]></category>

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

		<category><![CDATA[machine-learning]]></category>

		<category><![CDATA[population-sizing]]></category>

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

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

		<guid isPermaLink="false">http://kumarasastry.com/?p=270</guid>
		<description><![CDATA[Orriols-Puig, A., Goldberg, D. E., Sastry, K., Bernadó-Mansilla, E. (2007). Proceedings of the 2007 Genetic and Evolutionary Computation Conference (GECCO 2007). 1838–1845. [Preprint: IlliGAL report no. 2007001] [Full paper - DOI] [Presentation slides].



<script type="text/javascript">
SHARETHIS.addEntry({
	title: "Modeling XCS in class imbalances: Population sizing and parameter settings",
	url: "http://www.kumarasastry.com/2007/07/13/modeling-xcs-in-class-imbalances-population-sizing-and-parameter-settings/"
});
</script>
	]]></description>
			<content:encoded><![CDATA[<p>Orriols-Puig, A., Goldberg, D. E., Sastry, K., Bernadó-Mansilla, E. (2007). <em>Proceedings of the 2007 Genetic and Evolutionary Computation Conference (GECCO 2007)</em>. 1838–1845. [<a href="http://www.illigal.uiuc.edu/pub/papers/IlliGALs/2007001.pdf">Preprint: IlliGAL report no. 2007001</a>] [<a href="http://doi.acm.org/10.1145/1276958.1277324">Full paper - DOI</a>] [<a href="http://www.slideshare.net/kknsastry/modeling-xcs-in-class-imbalances-population-sizing-and-parameter-settings/download">Presentation slides</a>].</p>
<p><object type=application/x-shockwave-flash data=https://s3.amazonaws.com:443/slideshare/ssplayer.swf?id=77645&doc=modeling-xcs-in-class-imbalances-population-sizing-and-parameter-settings3902 width=425 height=348><param name=movie value=https://s3.amazonaws.com:443/slideshare/ssplayer.swf?id=77645&doc=modeling-xcs-in-class-imbalances-population-sizing-and-parameter-settings3902 /></object></p>
<p><a href="http://sharethis.com/item?publisher=d273ea37-cd14-46b1-8ffd-38871863f07e&title=Modeling+XCS+in+class+imbalances%3A+Population+sizing+and+parameter+settings&url=http%3A%2F%2Fwww.kumarasastry.com%2F2007%2F07%2F13%2Fmodeling-xcs-in-class-imbalances-population-sizing-and-parameter-settings%2F">ShareThis</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.kumarasastry.com/2007/07/13/modeling-xcs-in-class-imbalances-population-sizing-and-parameter-settings/feed/</wfw:commentRss>
		</item>
		<item>
		<title>Towards billion bit optimization via efficient genetic algorithms</title>
		<link>http://www.kumarasastry.com/2007/02/15/towards-billion-bit-optimization-via-efficient-genetic-algorithms/</link>
		<comments>http://www.kumarasastry.com/2007/02/15/towards-billion-bit-optimization-via-efficient-genetic-algorithms/#comments</comments>
		<pubDate>Fri, 16 Feb 2007 03:46:55 +0000</pubDate>
		<dc:creator>Kumara Sastry</dc:creator>
		
		<category><![CDATA[Estimation of Distribution Algorithms]]></category>

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

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

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

		<category><![CDATA[Technical Reports]]></category>

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

		<category><![CDATA[billion-bit]]></category>

		<category><![CDATA[billion-variable]]></category>

		<category><![CDATA[compact-genetic-algorithm]]></category>

		<category><![CDATA[gecco-2007]]></category>

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

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

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

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

		<guid isPermaLink="false">http://kumarasastry.com/?p=233</guid>
		<description><![CDATA[Sastry, K., Goldberg, D. E., Llorà, X. (2007). IlliGAL  Report No. 2007007. University of Illinois at Urbana-Champaign,  Urbana IL.   [Full paper - PDF] [Full paper - PS]. [Also see the following  paper in the journal complexity].


<script type="text/javascript">
SHARETHIS.addEntry({
	title: "Towards billion bit optimization via efficient genetic algorithms",
	url: "http://www.kumarasastry.com/2007/02/15/towards-billion-bit-optimization-via-efficient-genetic-algorithms/"
});
</script>
	]]></description>
			<content:encoded><![CDATA[<p>Sastry, K., Goldberg, D. E., Llorà, X. (2007). IlliGAL  Report No. 2007007. University of Illinois at Urbana-Champaign,  Urbana IL.   [<a href="http://www.illigal.uiuc.edu/pub/papers/IlliGALs/2007007.pdf">Full paper - PDF</a>] [<a href="http://www.illigal.uiuc.edu/pub/papers/IlliGALs/2007007.ps.Z">Full paper - PS</a>]. [<a href="http://www.kumarasastry.com/2007/01/18/toward-routine-billion-variable-optimization-using-genetic-algorithms/">Also see the following  paper in the journal complexity</a>].</p>
<p> <a href="http://www.kumarasastry.com/2007/02/15/towards-billion-bit-optimization-via-efficient-genetic-algorithms/#more-233" class="more-link">(more&#8230;)</a></p>
<p><a href="http://sharethis.com/item?publisher=d273ea37-cd14-46b1-8ffd-38871863f07e&title=Towards+billion+bit+optimization+via+efficient+genetic+algorithms&url=http%3A%2F%2Fwww.kumarasastry.com%2F2007%2F02%2F15%2Ftowards-billion-bit-optimization-via-efficient-genetic-algorithms%2F">ShareThis</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.kumarasastry.com/2007/02/15/towards-billion-bit-optimization-via-efficient-genetic-algorithms/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.kumarasastry.com/2007/02/11/lets-get-ready-to-rumble-redux-crossover-versus-mutation-head-to-head-on-exponentially-scaled-problems/</link>
		<comments>http://www.kumarasastry.com/2007/02/11/lets-get-ready-to-rumble-redux-crossover-versus-mutation-head-to-head-on-exponentially-scaled-problems/#comments</comments>
		<pubDate>Sun, 11 Feb 2007 18:57:21 +0000</pubDate>
		<dc:creator>Kumara Sastry</dc:creator>
		
		<category><![CDATA[Genetic and Evolutionary Algorithm Theory]]></category>

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

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

		<category><![CDATA[Technical Reports]]></category>

		<guid isPermaLink="false">http://kumarasastry.com/?p=232</guid>
		<description><![CDATA[Sastry, K., Goldberg, D. E. (2007). IlliGAL Report No. 2007005. University of Illinois at Urbana-Champaign, Urbana IL. [Full paper - PDF] [Full paper - PS].


<script type="text/javascript">
SHARETHIS.addEntry({
	title: "Let&#8217;s get ready to rumble redux: Crossover versus mutation head to head on exponentially scaled problems",
	url: "http://www.kumarasastry.com/2007/02/11/lets-get-ready-to-rumble-redux-crossover-versus-mutation-head-to-head-on-exponentially-scaled-problems/"
});
</script>
	]]></description>
			<content:encoded><![CDATA[<p>Sastry, K., Goldberg, D. E. (2007). IlliGAL Report No. 2007005. University of Illinois at Urbana-Champaign, Urbana IL. [<a href="http://www.illigal.uiuc.edu/pub/papers/IlliGALs/2007005.pdf">Full paper - PDF</a>] [<a href="http://www.illigal.uiuc.edu/pub/papers/IlliGALs/2007005.ps.Z">Full paper - PS</a>].</p>
<p> <a href="http://www.kumarasastry.com/2007/02/11/lets-get-ready-to-rumble-redux-crossover-versus-mutation-head-to-head-on-exponentially-scaled-problems/#more-232" class="more-link">(more&#8230;)</a></p>
<p><a href="http://sharethis.com/item?publisher=d273ea37-cd14-46b1-8ffd-38871863f07e&title=Let%26%238217%3Bs+get+ready+to+rumble+redux%3A+Crossover+versus+mutation+head+to+head+on+exponentially+scaled+problems&url=http%3A%2F%2Fwww.kumarasastry.com%2F2007%2F02%2F11%2Flets-get-ready-to-rumble-redux-crossover-versus-mutation-head-to-head-on-exponentially-scaled-problems%2F">ShareThis</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.kumarasastry.com/2007/02/11/lets-get-ready-to-rumble-redux-crossover-versus-mutation-head-to-head-on-exponentially-scaled-problems/feed/</wfw:commentRss>
		</item>
		<item>
		<title>Population sizing for entropy-based model building in genetic algorithms</title>
		<link>http://www.kumarasastry.com/2006/06/20/population-sizing-for-entropy-based-model-building-in-genetic-algorithms/</link>
		<comments>http://www.kumarasastry.com/2006/06/20/population-sizing-for-entropy-based-model-building-in-genetic-algorithms/#comments</comments>
		<pubDate>Tue, 20 Jun 2006 17:14:18 +0000</pubDate>
		<dc:creator>Kumara Sastry</dc:creator>
		
		<category><![CDATA[Estimation of Distribution Algorithms]]></category>

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

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

		<category><![CDATA[Technical Reports]]></category>

		<guid isPermaLink="false">http://kumarasastry.com/?p=192</guid>
		<description><![CDATA[Yu, T.-L., Sastry, K., Goldberg, D. E., Pelikan, M. (2006). lliGAL report no. 2006020. University of Illinois at Urbana Champaign.  [Full paper - PDF] [Full paper - PS] .


<script type="text/javascript">
SHARETHIS.addEntry({
	title: "Population sizing for entropy-based model building in genetic algorithms",
	url: "http://www.kumarasastry.com/2006/06/20/population-sizing-for-entropy-based-model-building-in-genetic-algorithms/"
});
</script>
	]]></description>
			<content:encoded><![CDATA[<p>Yu, T.-L., Sastry, K., Goldberg, D. E., Pelikan, M. (2006). lliGAL report no. 2006020. University of Illinois at Urbana Champaign.  [<a href="http://www.illigal.uiuc.edu/pub/papers/IlliGALs/2006020.pdf">Full paper - PDF</a>] [<a href="http://www.illigal.uiuc.edu/pub/papers/IlliGALs/2006020.ps.Z">Full paper - PS</a>] .</p>
<p> <a href="http://www.kumarasastry.com/2006/06/20/population-sizing-for-entropy-based-model-building-in-genetic-algorithms/#more-192" class="more-link">(more&#8230;)</a></p>
<p><a href="http://sharethis.com/item?publisher=d273ea37-cd14-46b1-8ffd-38871863f07e&title=Population+sizing+for+entropy-based+model+building+in+genetic+algorithms&url=http%3A%2F%2Fwww.kumarasastry.com%2F2006%2F06%2F20%2Fpopulation-sizing-for-entropy-based-model-building-in-genetic-algorithms%2F">ShareThis</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.kumarasastry.com/2006/06/20/population-sizing-for-entropy-based-model-building-in-genetic-algorithms/feed/</wfw:commentRss>
		</item>
		<item>
		<title>Analysis of ideal recombination on random decomposable problems</title>
		<link>http://www.kumarasastry.com/2006/04/08/analysis-of-ideal-recombination-on-random-decomposable-problems/</link>
		<comments>http://www.kumarasastry.com/2006/04/08/analysis-of-ideal-recombination-on-random-decomposable-problems/#comments</comments>
		<pubDate>Sat, 08 Apr 2006 18:39:58 +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[Publications]]></category>

		<category><![CDATA[Technical Reports]]></category>

		<guid isPermaLink="false">http://kumarasastry.com/?p=179</guid>
		<description><![CDATA[Sastry, K., Pelikan, M., Goldberg, D. E. (2006). IlliGAL report no. 2006016, and MEDAL report no. 2006004. University of Illinois at Urbana Champaign.  [Full paper - PDF] [Full paper - PS] .


<script type="text/javascript">
SHARETHIS.addEntry({
	title: "Analysis of ideal recombination on random decomposable problems",
	url: "http://www.kumarasastry.com/2006/04/08/analysis-of-ideal-recombination-on-random-decomposable-problems/"
});
</script>
	]]></description>
			<content:encoded><![CDATA[<p>Sastry, K., Pelikan, M., Goldberg, D. E. (2006). IlliGAL report no. 2006016, and MEDAL report no. 2006004. University of Illinois at Urbana Champaign.  [<a href="http://www.illigal.uiuc.edu/pub/papers/IlliGALs/2006016.pdf">Full paper - PDF</a>] [<a href="http://www.illigal.uiuc.edu/pub/papers/IlliGALs/2006016.ps.Z">Full paper - PS</a>] .</p>
<p> <a href="http://www.kumarasastry.com/2006/04/08/analysis-of-ideal-recombination-on-random-decomposable-problems/#more-179" class="more-link">(more&#8230;)</a></p>
<p><a href="http://sharethis.com/item?publisher=d273ea37-cd14-46b1-8ffd-38871863f07e&title=Analysis+of+ideal+recombination+on+random+decomposable+problems&url=http%3A%2F%2Fwww.kumarasastry.com%2F2006%2F04%2F08%2Fanalysis-of-ideal-recombination-on-random-decomposable-problems%2F">ShareThis</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.kumarasastry.com/2006/04/08/analysis-of-ideal-recombination-on-random-decomposable-problems/feed/</wfw:commentRss>
		</item>
	</channel>
</rss>
