<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns:burst="http://xmlns.com/burst/0.1/" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" xmlns="http://purl.org/rss/1.0/" xmlns:admin="http://webns.net/mvcb/" xmlns:rdfs="http://www.w3.org/2000/01/rdf-schema#" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:owl="http://www.w3.org/2002/07/owl#" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:syn="http://purl.org/rss/1.0/modules/syndication/" xmlns:swrc="http://swrc.ontoware.org/ontology#" xmlns:cc="http://web.resource.org/cc/"><channel rdf:about="http://www.bibsonomy.org/user/schaul"><title>BibSonomy publications for /user/schaul</title><link>BibSonomypublrss/user/schaul</link><description>BibSonomy RSS feed for /user/schaul</description><dc:date>2012-02-15T12:51:55+01:00</dc:date><items><rdf:Seq><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/28969aae0ed7d0829c17ce7411f2bcdc7/schaul"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/28192988ef1ed0e526026b14386579030/schaul"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2ba7d96561c76b3ef903c9058197cd1c1/schaul"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/297049a49146280b30b45e0115b08ac7d/schaul"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/23e75c517832b18be3e327c098df1adfd/schaul"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2b16e56cb675bc395c0b868e659f6ed26/schaul"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2aa96bdfd16e9593aec3eab071e445966/schaul"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2255f2c6da1a8995e57d60a697219992e/schaul"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/241406f69681b40d610664492e3dc4d1c/schaul"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/22548e25c4316e6d365a1cda13910c7b1/schaul"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/279df6721c014a00bfac62abd7d5a9968/schaul"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2825192e2b52551362862b4b20fbbea1c/schaul"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2308dfb505e23a977417d69d6a94d1cad/schaul"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2b03f900e582e764963efe48e4d76f0bc/schaul"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/20a13668f6995399e22b001c9eeba0b7a/schaul"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/299396210934937d279f29a0e10f9ee8f/schaul"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2bf34d745d798e80585c4590e621fcd37/schaul"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/204cab5fc779db34f662a2ae0f25e96ad/schaul"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2143b3278d469900d7b42be66c0611739/schaul"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/26ed054d7babe82af8c357947ba30f660/schaul"/></rdf:Seq></items></channel><item rdf:about="http://www.bibsonomy.org/bibtex/28969aae0ed7d0829c17ce7411f2bcdc7/schaul"><title>Policy Gradient Reinforcement Learning for Fast Quadrupedal Locomotion</title><link>http://www.bibsonomy.org/bibtex/28969aae0ed7d0829c17ce7411f2bcdc7/schaul</link><dc:creator>schaul</dc:creator><dc:date>2008-02-26T12:05:08+01:00</dc:date><dc:subject>daanbib </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Kohl&#034;&gt;Nate Kohl&lt;/a&gt;,  and &lt;a href=&#034;/author/Stone&#034;&gt;Peter Stone&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Proceedings of the IEEE International Conference on Robotics and Automation, &lt;/em&gt;(&lt;em&gt;May 2004&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/daanbib"/></rdf:Bag></taxo:topics><description>idsia</description></item><item rdf:about="http://www.bibsonomy.org/bibtex/28192988ef1ed0e526026b14386579030/schaul"><title>Evolving Keepaway Soccer Players through Task Decomposition</title><link>http://www.bibsonomy.org/bibtex/28192988ef1ed0e526026b14386579030/schaul</link><dc:creator>schaul</dc:creator><dc:date>2008-02-26T12:05:08+01:00</dc:date><dc:subject>daanbib </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Whiteson&#034;&gt;Shimon Whiteson&lt;/a&gt;, &lt;a href=&#034;/author/Kohl&#034;&gt;Nate Kohl&lt;/a&gt;, &lt;a href=&#034;/author/Miikkulainen&#034;&gt;Risto Miikkulainen&lt;/a&gt;,  and &lt;a href=&#034;/author/Stone&#034;&gt;Peter Stone&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Machine Learning&lt;/em&gt; &lt;em&gt;59(1):5--30&lt;/em&gt; (&lt;em&gt;May 2005&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/daanbib"/></rdf:Bag></taxo:topics><description>idsia</description></item><item rdf:about="http://www.bibsonomy.org/bibtex/2ba7d96561c76b3ef903c9058197cd1c1/schaul"><title>Hierarchical Policy Gradient Algorithms</title><link>http://www.bibsonomy.org/bibtex/2ba7d96561c76b3ef903c9058197cd1c1/schaul</link><dc:creator>schaul</dc:creator><dc:date>2008-02-26T12:05:08+01:00</dc:date><dc:subject>daanbib </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Ghavamzadeh&#034;&gt;M. Ghavamzadeh&lt;/a&gt;,  and &lt;a href=&#034;/author/Mahadevan&#034;&gt;Sridhar Mahadevan&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Proceedings of the Twentieth Conference on Machine Learning ICML-2003, &lt;/em&gt;(&lt;em&gt;2003&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/daanbib"/></rdf:Bag></taxo:topics><description>idsia</description></item><item rdf:about="http://www.bibsonomy.org/bibtex/297049a49146280b30b45e0115b08ac7d/schaul"><title>Reinforcement Learning for RoboCup-Soccer Keepaway</title><link>http://www.bibsonomy.org/bibtex/297049a49146280b30b45e0115b08ac7d/schaul</link><dc:creator>schaul</dc:creator><dc:date>2008-02-26T12:05:08+01:00</dc:date><dc:subject>daanbib </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Stone&#034;&gt;Peter Stone&lt;/a&gt;, &lt;a href=&#034;/author/Sutton&#034;&gt;Richard S. Sutton&lt;/a&gt;,  and &lt;a href=&#034;/author/Kuhlmann&#034;&gt;Gregory Kuhlmann&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Adaptive Behavior&lt;/em&gt; &lt;em&gt;13(3):165--188&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/daanbib"/></rdf:Bag></taxo:topics><description>idsia</description></item><item rdf:about="http://www.bibsonomy.org/bibtex/23e75c517832b18be3e327c098df1adfd/schaul"><title>Reinforcement learning with long short-term memory</title><link>http://www.bibsonomy.org/bibtex/23e75c517832b18be3e327c098df1adfd/schaul</link><dc:creator>schaul</dc:creator><dc:date>2008-02-26T12:05:08+01:00</dc:date><dc:subject>daanbib </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Bakker&#034;&gt;B. Bakker&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Advances in Neural Information Processing Syst., 14, &lt;/em&gt;(&lt;em&gt;2002&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/daanbib"/></rdf:Bag></taxo:topics><description>idsia</description></item><item rdf:about="http://www.bibsonomy.org/bibtex/2b16e56cb675bc395c0b868e659f6ed26/schaul"><title>Natural Actor-Critic</title><link>http://www.bibsonomy.org/bibtex/2b16e56cb675bc395c0b868e659f6ed26/schaul</link><dc:creator>schaul</dc:creator><dc:date>2008-02-26T12:05:08+01:00</dc:date><dc:subject>daanbib </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Peters&#034;&gt;J. Peters&lt;/a&gt;, &lt;a href=&#034;/author/Vijayakumar&#034;&gt;S. Vijayakumar&lt;/a&gt;,  and &lt;a href=&#034;/author/Schaal&#034;&gt;S. Schaal&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Proceedings of the 16th European Conference on Machine Learning ECML 2005, &lt;/em&gt;&lt;em&gt;page 280--291. &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/daanbib"/></rdf:Bag></taxo:topics><description>idsia</description></item><item rdf:about="http://www.bibsonomy.org/bibtex/2aa96bdfd16e9593aec3eab071e445966/schaul"><title>Fast Online Policy Gradient Learning with SMD Gain Vector Adaptation</title><link>http://www.bibsonomy.org/bibtex/2aa96bdfd16e9593aec3eab071e445966/schaul</link><dc:creator>schaul</dc:creator><dc:date>2008-02-26T12:05:08+01:00</dc:date><dc:subject>daanbib </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Schraudolph&#034;&gt;Nicol Schraudolph&lt;/a&gt;, &lt;a href=&#034;/author/Yu&#034;&gt;Jin Yu&lt;/a&gt;,  and &lt;a href=&#034;/author/Aberdeen&#034;&gt;Douglas Aberdeen&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Advances in Neural Information Processing Systems 18, &lt;/em&gt;&lt;em&gt;MIT Press, &lt;/em&gt;&lt;em&gt;Cambridge, MA, &lt;/em&gt;(&lt;em&gt;2006&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/daanbib"/></rdf:Bag></taxo:topics><description>idsia</description></item><item rdf:about="http://www.bibsonomy.org/bibtex/2255f2c6da1a8995e57d60a697219992e/schaul"><title>Reinforcement Learning Through Gradient Descent</title><link>http://www.bibsonomy.org/bibtex/2255f2c6da1a8995e57d60a697219992e/schaul</link><dc:creator>schaul</dc:creator><dc:date>2008-02-26T12:05:08+01:00</dc:date><dc:subject>daanbib </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Baird&#034;&gt;L. Baird&lt;/a&gt; &lt;/span&gt;(&lt;em&gt;1999&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/daanbib"/></rdf:Bag></taxo:topics><description>idsia</description></item><item rdf:about="http://www.bibsonomy.org/bibtex/241406f69681b40d610664492e3dc4d1c/schaul"><title>A learning algorithm for continually running fully recurrent networks</title><link>http://www.bibsonomy.org/bibtex/241406f69681b40d610664492e3dc4d1c/schaul</link><dc:creator>schaul</dc:creator><dc:date>2008-02-26T12:05:08+01:00</dc:date><dc:subject>daanbib </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Williams&#034;&gt;R. J. Williams&lt;/a&gt;,  and &lt;a href=&#034;/author/Zipser&#034;&gt;D. Zipser&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Neural Computation&lt;/em&gt; &lt;em&gt;1(2):270--280&lt;/em&gt; (&lt;em&gt;1989&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/daanbib"/></rdf:Bag></taxo:topics><description>idsia</description></item><item rdf:about="http://www.bibsonomy.org/bibtex/22548e25c4316e6d365a1cda13910c7b1/schaul"><title>Learning Nonregular Languages: A Comparison of Simple Recurrent Networks and LSTM</title><link>http://www.bibsonomy.org/bibtex/22548e25c4316e6d365a1cda13910c7b1/schaul</link><dc:creator>schaul</dc:creator><dc:date>2008-02-26T12:05:08+01:00</dc:date><dc:subject>daanbib </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Schmidhuber&#034;&gt;J. Schmidhuber&lt;/a&gt;, &lt;a href=&#034;/author/Gers&#034;&gt;F. Gers&lt;/a&gt;,  and &lt;a href=&#034;/author/Eck&#034;&gt;D. Eck&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Neural Computation&lt;/em&gt; &lt;em&gt;14(9):2039--2041&lt;/em&gt; (&lt;em&gt;2002&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/daanbib"/></rdf:Bag></taxo:topics><description>idsia</description></item><item rdf:about="http://www.bibsonomy.org/bibtex/279df6721c014a00bfac62abd7d5a9968/schaul"><title>Gradient flow in recurrent nets: the difficulty of learning long-term dependencies</title><link>http://www.bibsonomy.org/bibtex/279df6721c014a00bfac62abd7d5a9968/schaul</link><dc:creator>schaul</dc:creator><dc:date>2008-02-26T12:05:08+01:00</dc:date><dc:subject>daanbib </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Hochreiter&#034;&gt;S. Hochreiter&lt;/a&gt;, &lt;a href=&#034;/author/Bengio&#034;&gt;Y. Bengio&lt;/a&gt;, &lt;a href=&#034;/author/Frasconi&#034;&gt;P. Frasconi&lt;/a&gt;,  and &lt;a href=&#034;/author/Schmidhuber&#034;&gt;J. Schmidhuber&lt;/a&gt; &lt;/span&gt;&lt;em&gt;A Field Guide to Dynamical Recurrent Neural Networks, &lt;/em&gt;&lt;em&gt;IEEE Press, &lt;/em&gt;(&lt;em&gt;2001&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/daanbib"/></rdf:Bag></taxo:topics><description>idsia</description></item><item rdf:about="http://www.bibsonomy.org/bibtex/2825192e2b52551362862b4b20fbbea1c/schaul"><title>RNN overview</title><link>http://www.bibsonomy.org/bibtex/2825192e2b52551362862b4b20fbbea1c/schaul</link><dc:creator>schaul</dc:creator><dc:date>2008-02-26T12:05:08+01:00</dc:date><dc:subject>daanbib </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Schmidhuber&#034;&gt;J. Schmidhuber&lt;/a&gt; &lt;/span&gt;(&lt;em&gt;2004&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/daanbib"/></rdf:Bag></taxo:topics><description>idsia</description></item><item rdf:about="http://www.bibsonomy.org/bibtex/2308dfb505e23a977417d69d6a94d1cad/schaul"><title>Reinforcement learning and its application to control</title><link>http://www.bibsonomy.org/bibtex/2308dfb505e23a977417d69d6a94d1cad/schaul</link><dc:creator>schaul</dc:creator><dc:date>2008-02-26T12:05:08+01:00</dc:date><dc:subject>daanbib </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Gullapalli&#034;&gt;V. Gullapalli&lt;/a&gt; &lt;/span&gt;(&lt;em&gt;1992&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/daanbib"/></rdf:Bag></taxo:topics><description>idsia</description></item><item rdf:about="http://www.bibsonomy.org/bibtex/2b03f900e582e764963efe48e4d76f0bc/schaul"><title>Two-phase nozzle and hollow core jet experiments</title><link>http://www.bibsonomy.org/bibtex/2b03f900e582e764963efe48e4d76f0bc/schaul</link><dc:creator>schaul</dc:creator><dc:date>2008-02-26T12:05:08+01:00</dc:date><dc:subject>daanbib </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Klockgether&#034;&gt;J. Klockgether&lt;/a&gt;,  and &lt;a href=&#034;/author/Schwefel&#034;&gt;H. P. Schwefel&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Proc. 11th Symp. Engineering Aspects of Magnetohydrodynamics, &lt;/em&gt;&lt;em&gt;page 141--148. &lt;/em&gt;(&lt;em&gt;1970&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/daanbib"/></rdf:Bag></taxo:topics><description>idsia</description></item><item rdf:about="http://www.bibsonomy.org/bibtex/20a13668f6995399e22b001c9eeba0b7a/schaul"><title>Stochastic optimization and the simultaneous perturbation method</title><link>http://www.bibsonomy.org/bibtex/20a13668f6995399e22b001c9eeba0b7a/schaul</link><dc:creator>schaul</dc:creator><dc:date>2008-02-26T12:05:08+01:00</dc:date><dc:subject>daanbib </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Spall&#034;&gt;James C. Spall&lt;/a&gt; &lt;/span&gt;&lt;em&gt;WSC &amp;#039;99: Proceedings of the 31st conference on Winter simulation, &lt;/em&gt;&lt;em&gt;page 101--109. &lt;/em&gt;&lt;em&gt;New York, NY, USA, &lt;/em&gt;&lt;em&gt;ACM, &lt;/em&gt;(&lt;em&gt;1999&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/daanbib"/></rdf:Bag></taxo:topics><description>idsia</description></item><item rdf:about="http://www.bibsonomy.org/bibtex/299396210934937d279f29a0e10f9ee8f/schaul"><title>Swarm intelligence</title><link>http://www.bibsonomy.org/bibtex/299396210934937d279f29a0e10f9ee8f/schaul</link><dc:creator>schaul</dc:creator><dc:date>2008-02-26T12:05:08+01:00</dc:date><dc:subject>daanbib </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Kennedy&#034;&gt;James Kennedy&lt;/a&gt;,  and &lt;a href=&#034;/author/Eberhart&#034;&gt;Russell C. Eberhart&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Morgan Kaufmann Publishers Inc., &lt;/em&gt;&lt;em&gt;San Francisco, CA, USA, &lt;/em&gt;(&lt;em&gt;2001&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/daanbib"/></rdf:Bag></taxo:topics><description>idsia</description></item><item rdf:about="http://www.bibsonomy.org/bibtex/2bf34d745d798e80585c4590e621fcd37/schaul"><title>Optimization by Simulated Annealing</title><link>http://www.bibsonomy.org/bibtex/2bf34d745d798e80585c4590e621fcd37/schaul</link><dc:creator>schaul</dc:creator><dc:date>2008-02-26T12:05:08+01:00</dc:date><dc:subject>daanbib </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Kirkpatrick&#034;&gt;S. Kirkpatrick&lt;/a&gt;, &lt;a href=&#034;/author/Gelatt&#034;&gt;C. D. Gelatt&lt;/a&gt;,  and &lt;a href=&#034;/author/Vecchi&#034;&gt;M. P. Vecchi&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Science, Number 4598, 13 May 1983&lt;/em&gt;  (&lt;em&gt;1983&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/daanbib"/></rdf:Bag></taxo:topics><description>idsia</description></item><item rdf:about="http://www.bibsonomy.org/bibtex/204cab5fc779db34f662a2ae0f25e96ad/schaul"><title>Natural Gradient Works Efficiently in Learning</title><link>http://www.bibsonomy.org/bibtex/204cab5fc779db34f662a2ae0f25e96ad/schaul</link><dc:creator>schaul</dc:creator><dc:date>2008-02-26T12:05:08+01:00</dc:date><dc:subject>daanbib </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Amari&#034;&gt;S. Amari&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Neural Computation&lt;/em&gt; &lt;em&gt;10(2):251--276&lt;/em&gt; (&lt;em&gt;1998&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/daanbib"/></rdf:Bag></taxo:topics><description>idsia</description></item><item rdf:about="http://www.bibsonomy.org/bibtex/2143b3278d469900d7b42be66c0611739/schaul"><title>Similarities and differences between policy gradient methods and evolution strategies</title><link>http://www.bibsonomy.org/bibtex/2143b3278d469900d7b42be66c0611739/schaul</link><dc:creator>schaul</dc:creator><dc:date>2008-02-26T12:05:08+01:00</dc:date><dc:subject>daanbib </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Meisner&#034;&gt;Verena H. Meisner&lt;/a&gt;,  and &lt;a href=&#034;/author/Igel&#034;&gt;Christian Igel&lt;/a&gt; &lt;/span&gt;&lt;em&gt;To appear in: 16th European Symposium on Artificial Neural Networks ESANN, &lt;/em&gt;(&lt;em&gt;2008&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/daanbib"/></rdf:Bag></taxo:topics><description>idsia</description></item><item rdf:about="http://www.bibsonomy.org/bibtex/26ed054d7babe82af8c357947ba30f660/schaul"><title>A Tutorial on the Cross-Entropy Method</title><link>http://www.bibsonomy.org/bibtex/26ed054d7babe82af8c357947ba30f660/schaul</link><dc:creator>schaul</dc:creator><dc:date>2008-02-26T12:05:08+01:00</dc:date><dc:subject>daanbib </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Boer&#034;&gt;P. De Boer&lt;/a&gt;, &lt;a href=&#034;/author/Kroese&#034;&gt; Kroese&lt;/a&gt;, &lt;a href=&#034;/author/Mannor&#034;&gt;S. Mannor&lt;/a&gt;,  and &lt;a href=&#034;/author/Rubinstein&#034;&gt;R. Y. Rubinstein&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Annals of Operations Research, &lt;/em&gt;&lt;em&gt; 134, &lt;/em&gt;&lt;em&gt;page 19--67. &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/daanbib"/></rdf:Bag></taxo:topics><description>idsia</description></item></rdf:RDF>
