http://popups.lib.uliege.be/1373-5411/index.php?id=161 Index terms fr 0 http://popups.lib.uliege.be/1373-5411/index.php?id=845 This paper deals with a singular comportment of an incursive algorithm. This algorithm has been primary developed to optimise a production process. It is closed to classical genetic algorithms because it uses these major stages determination of n random solutions, evaluation of the solutions (in our case with the simulation of production process), selection of the best solution and reproduction according to the biologic rules of crossing over. Nevertheless the differences between this algorithm and a classical genetic algorithm are : the use of incursion in the selection's stage and the singularity of the reproduction stage. The algorithm enables indeed to optimise the system configuration by optimising the laws of reproduction. The "crossing over" becomes a specific case among huge other configurations. Despite we expect that the algorithm will be able to adapt his reproduction laws to the specificity of the system studied, the comportment of the optimisation, due to the use of incursion is unexpected and unfortunately unable to solve our production matter. Nevertheless this comportment is very interesting to study the consequences of the use of incursion with a genetic algorithm. Mon, 01 Jul 2024 14:01:30 +0200 Tue, 08 Oct 2024 17:16:15 +0200 http://popups.lib.uliege.be/1373-5411/index.php?id=845 http://popups.lib.uliege.be/1373-5411/index.php?id=156 This paper shows that different algorithmic methods can generate self-symmetrical Sierpinski fractals. A first category deals with a hyperincursive generator based on a composition rule applied to a defined path in the frame. A second category of algorithms is based on a recursive generator obeying certain symmetries. This paper will consider generalised Sierpinski fractals generated by modulo 2 and modulo 3. Even and odd modulo give rise to very different properties of symmetry. Tue, 18 Jun 2024 16:40:48 +0200 Tue, 18 Jun 2024 16:41:02 +0200 http://popups.lib.uliege.be/1373-5411/index.php?id=156