<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0">
  <channel>
    <title>attractors</title>
    <link>http://popups.lib.uliege.be/1373-5411/index.php?id=647</link>
    <description>Index terms</description>
    <language>fr</language>
    <ttl>0</ttl>
    <item>
      <title>Did Artificial Systems Need Random for Learning Strategies ?</title>
      <link>http://popups.lib.uliege.be/1373-5411/index.php?id=643</link>
      <description>Many analogies found in natural systems give evidence that the role of noise in a complex system might well lead to further organization. So, noise seems a good way in order to create novelty or to test the strength of algorithms. In this paper, we are going to analyse some artificial learning mechanisms such as genetic algorithms or neural networks, which may be generally formulated as an optimization problem by specifying a performance criterion, and then by using the simple but powerful technique of stochastic hill-climbing along the gradient. In these algorithms, the integration of random is a good way to maintain the exploration property during searching, useful for avoiding local optima or when environment is dynamic. We claim that artificial learning must overcome their limitations using the expedient of random search. This is due to attractors always present inside search procedures. We discuss in order to find another way to create order without having any presupposed attractors. This is also a central question for anticipatory systems which must learn about themselves and their environment. </description>
      <pubDate>Fri, 28 Jun 2024 16:01:34 +0200</pubDate>
      <lastBuildDate>Tue, 08 Oct 2024 14:07:42 +0200</lastBuildDate>
      <guid isPermaLink="true">http://popups.lib.uliege.be/1373-5411/index.php?id=643</guid>
    </item>
    <item>
      <title>Investigation of Complex Multivalued Solutions in Discrete Dynamical Systems With Anticipation</title>
      <link>http://popups.lib.uliege.be/1373-5411/index.php?id=3942</link>
      <description>Since the introduction of strong anticipation by D. Dubois the numerous investigations of concrete systems had been proposed. Discrete dynamical systems with anticipation constitute one of such system class. But not very many investigations of such objects exist recently. More intensive investigationso f counterpartst o properties of common systems need- namely to stability of solutions, bifurcation diagrams, chaotic behavior. So the investigation of one modification of well known logistic equation by anticipatory property is considered. One of the most interesting properties in such systems is presumable multivaluednes of the solutions. The next issues are described : the examples of periodic and complex solutions, attractor’s properties, and dependence on the parameters. </description>
      <pubDate>Tue, 01 Oct 2024 15:51:00 +0200</pubDate>
      <lastBuildDate>Tue, 01 Oct 2024 15:51:11 +0200</lastBuildDate>
      <guid isPermaLink="true">http://popups.lib.uliege.be/1373-5411/index.php?id=3942</guid>
    </item>
  </channel>
</rss>