<rdf:RDF xmlns:burst="http://xmlns.com/burst/0.1/" xmlns:admin="http://webns.net/mvcb/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:syn="http://purl.org/rss/1.0/modules/syndication/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns:owl="http://www.w3.org/2002/07/owl#" xmlns:cc="http://web.resource.org/cc/" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" xmlns:swrc="http://swrc.ontoware.org/ontology#" xmlns:rdfs="http://www.w3.org/2000/01/rdf-schema#" xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"><channel rdf:about="http://www.bibsonomy.org/burst/user/schaul/algorithm,"><title>BibSonomy publications for /user/schaul/algorithm,</title><link>http://www.bibsonomy.org/burst/user/schaul/algorithm,</link><description>BibSonomy BuRST Feed for /user/schaul/algorithm,</description><dc:date>2008-07-26T04:33:22+02:00</dc:date><items><rdf:Seq><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/223bbad699e144c584ba1ef426db00524/schaul"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2faf5563250898f0a4cd12dd900a08913/schaul"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/208a8dfde4e1c9fe9b6f6b1ebe570cece/schaul"/></rdf:Seq></items></channel><item rdf:about="http://www.bibsonomy.org/bibtex/223bbad699e144c584ba1ef426db00524/schaul"><title>Fitness Uniform Deletion for Robust Optimization</title><description>idsia</description><link>http://www.bibsonomy.org/bibtex/223bbad699e144c584ba1ef426db00524/schaul</link><dc:creator>schaul</dc:creator><dc:date>2008-02-26T11:58:58+01:00</dc:date><dc:subject>algorithm, schemes, selfadaptation optimization, juergen, evaluation, evolutionary, deletion, landscapes, fitness, </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;S. &lt;a href=&#034;http://www.bibsonomy.org/author/Legg&#034;&gt;Legg&lt;/a&gt;  and M. &lt;a href=&#034;http://www.bibsonomy.org/author/Hutter&#034;&gt;Hutter&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Proc. Genetic and Evolutionary Computation Conference (GECCO&#039;05), &lt;/em&gt;&lt;em&gt;page1271--1278. &lt;/em&gt;&lt;em&gt;Washington, OR, &lt;/em&gt;&lt;em&gt;ACM SigEvo, &lt;/em&gt;(&lt;em&gt;2005&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/algorithm,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/schemes,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/selfadaptation"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/optimization,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/juergen,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/evaluation,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/evolutionary,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/deletion,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/landscapes,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/fitness,"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/223bbad699e144c584ba1ef426db00524/schaul"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/223bbad699e144c584ba1ef426db00524/schaul"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><owl:sameAs rdf:resource="http://arxiv.org/abs/cs.NE/0504035"/><swrc:date>Tue Feb 26 11:58:58 CET 2008</swrc:date><swrc:address>Washington, OR</swrc:address><swrc:booktitle>Proc. Genetic and Evolutionary Computation Conference ({GECCO&#039;05})</swrc:booktitle><swrc:pages>1271--1278</swrc:pages><swrc:publisher><swrc:Organization swrc:name="ACM SigEvo"/></swrc:publisher><swrc:title>Fitness Uniform Deletion for Robust Optimization</swrc:title><swrc:year>2005</swrc:year><swrc:keywords>algorithm, schemes, selfadaptation optimization, juergen, evaluation, evolutionary, deletion, landscapes, fitness, </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="2382168" swrc:key="id"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="2" swrc:key="priority"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="S. Legg"/></rdf:_1><rdf:_2><swrc:Person swrc:name="M. Hutter"/></rdf:_2></rdf:Seq></swrc:author><swrc:editor><rdf:Seq><rdf:_1><swrc:Person swrc:name="H. G. Beyer"/></rdf:_1></rdf:Seq></swrc:editor></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/2faf5563250898f0a4cd12dd900a08913/schaul"><title>Fast Non-Parametric Bayesian Inference on Infinite Trees</title><description>idsia</description><link>http://www.bibsonomy.org/bibtex/2faf5563250898f0a4cd12dd900a08913/schaul</link><dc:creator>schaul</dc:creator><dc:date>2008-02-26T11:58:58+01:00</dc:date><dc:subject>tree bayesian, exact, inference, adaptive, juergen, density, non-parametric, polya, time, estimation, algorithm, infinite, scale, invariance, linear, </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;M. &lt;a href=&#034;http://www.bibsonomy.org/author/Hutter&#034;&gt;Hutter&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Proc. 10th International Conf. on Artificial Intelligence and Statistics (AISTATS-2005), &lt;/em&gt;&lt;em&gt;page144--151. &lt;/em&gt;&lt;em&gt;Society for Artificial Intelligence and Statistics, &lt;/em&gt;(&lt;em&gt;2005&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/tree"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/bayesian,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/exact,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/inference,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/adaptive,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/juergen,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/density,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/non-parametric,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/polya,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/time,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/estimation,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/algorithm,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/infinite,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/scale,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/invariance,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/linear,"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2faf5563250898f0a4cd12dd900a08913/schaul"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2faf5563250898f0a4cd12dd900a08913/schaul"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><owl:sameAs rdf:resource="http://arxiv.org/abs/math.PR/0411515"/><swrc:date>Tue Feb 26 11:58:58 CET 2008</swrc:date><swrc:booktitle>Proc. 10th International Conf. on Artificial Intelligence and Statistics ({AISTATS-2005})</swrc:booktitle><swrc:pages>144--151</swrc:pages><swrc:publisher><swrc:Organization swrc:name="Society for Artificial Intelligence and Statistics"/></swrc:publisher><swrc:title>Fast Non-Parametric {B}ayesian Inference on Infinite Trees</swrc:title><swrc:year>2005</swrc:year><swrc:keywords>tree bayesian, exact, inference, adaptive, juergen, density, non-parametric, polya, time, estimation, algorithm, infinite, scale, invariance, linear, </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="2382170" swrc:key="id"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="2" swrc:key="priority"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="M. Hutter"/></rdf:_1></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/208a8dfde4e1c9fe9b6f6b1ebe570cece/schaul"><title>Tournament versus Fitness Uniform Selection</title><description>idsia</description><link>http://www.bibsonomy.org/bibtex/208a8dfde4e1c9fe9b6f6b1ebe570cece/schaul</link><dc:creator>schaul</dc:creator><dc:date>2008-02-26T11:58:58+01:00</dc:date><dc:subject>multimodal, optimization, principles, selfadaptation, juergen, basic, selection, computations, schemes, of, algorithm, evolutionary, fitness, deceptive, evaluation, working landscapes, problems, </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;S. &lt;a href=&#034;http://www.bibsonomy.org/author/Legg&#034;&gt;Legg&lt;/a&gt;  and M. &lt;a href=&#034;http://www.bibsonomy.org/author/Hutter&#034;&gt;Hutter&lt;/a&gt;  and A. &lt;a href=&#034;http://www.bibsonomy.org/author/Kumar&#034;&gt;Kumar&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Proc. 2004 Congress on Evolutionary Computation (CEC&#039;04), &lt;/em&gt;&lt;em&gt;page2144--2151. &lt;/em&gt;&lt;em&gt;Portland, OR, &lt;/em&gt;&lt;em&gt;IEEE, &lt;/em&gt;(&lt;em&gt;2004&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/multimodal,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/optimization,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/principles,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/selfadaptation,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/juergen,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/basic,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/selection,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/computations,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/schemes,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/of,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/algorithm,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/evolutionary,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/fitness,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/deceptive,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/evaluation,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/working"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/landscapes,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/problems,"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/208a8dfde4e1c9fe9b6f6b1ebe570cece/schaul"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/208a8dfde4e1c9fe9b6f6b1ebe570cece/schaul"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><owl:sameAs rdf:resource="http://arxiv.org/abs/cs.LG/0403038"/><swrc:date>Tue Feb 26 11:58:58 CET 2008</swrc:date><swrc:address>Portland, OR</swrc:address><swrc:booktitle>Proc. 2004 Congress on Evolutionary Computation ({CEC&#039;04})</swrc:booktitle><swrc:pages>2144--2151</swrc:pages><swrc:publisher><swrc:Organization swrc:name="IEEE"/></swrc:publisher><swrc:title>Tournament versus Fitness Uniform Selection</swrc:title><swrc:year>2004</swrc:year><swrc:keywords>multimodal, optimization, principles, selfadaptation, juergen, basic, selection, computations, schemes, of, algorithm, evolutionary, fitness, deceptive, evaluation, working landscapes, problems, </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="2382175" swrc:key="id"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="2" swrc:key="priority"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="S. Legg"/></rdf:_1><rdf:_2><swrc:Person swrc:name="M. Hutter"/></rdf:_2><rdf:_3><swrc:Person swrc:name="A. Kumar"/></rdf:_3></rdf:Seq></swrc:author></rdf:Description></burst:publication></item></rdf:RDF>