<?xml version="1.0" encoding="UTF-8"?>
<feed xmlns="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
<title>Volumen 01 | Número 02</title>
<link href="http://sedici.unlp.edu.ar:80/handle/10915/371" rel="alternate"/>
<subtitle/>
<id>http://sedici.unlp.edu.ar:80/handle/10915/371</id>
<updated>2026-11-18T19:37:03Z</updated>
<dc:date>2026-11-18T19:37:03Z</dc:date>
<entry>
<title>Letter from the Editor</title>
<link href="http://sedici.unlp.edu.ar:80/handle/10915/50685" rel="alternate"/>
<author>
<name>Jordán, Ramiro</name>
</author>
<id>http://sedici.unlp.edu.ar:80/handle/10915/50685</id>
<updated>2019-06-15T20:02:46Z</updated>
<published>2000-03-01T00:00:00Z</published>
<summary type="text">Contribucion a revista
Journal of Computer Science &amp; Technology; vol. 1, no. 2
Presentación del contenido del presente número.
</summary>
<dc:date>2000-03-01T00:00:00Z</dc:date>
<dc:description>Presentación del contenido del presente número.</dc:description>
</entry>
<entry>
<title>Evolutionary optimization in non-stationary environments</title>
<link href="http://sedici.unlp.edu.ar:80/handle/10915/43858" rel="alternate"/>
<author>
<name>Trojanowski, Krzysztof</name>
</author>
<author>
<name>Michalewicz, Zbigniew</name>
</author>
<id>http://sedici.unlp.edu.ar:80/handle/10915/43858</id>
<updated>2019-06-15T20:02:44Z</updated>
<published>2000-03-01T00:00:00Z</published>
<summary type="text">Articulo
Journal of Computer Science &amp; Technology; vol. 1, no. 2
As most real-world problemas are dynamic, it is not sufficient to "solve" the problem for the some (current) scenario, but it is also necessary to modify the current solution due to various changes in the environment (e. g., machine breakdowns, sickness of employees, etc.). Thus it is important to investigate properties of adaptive algorithms which do not require re-start every time a change is recorded. In this paper such non-stationary problems (i. e., problems, which change in time) are considered. We describe different types of changes in the environment. A new model for non-stationary problems and a classifcation of these problems by the type of changes is proposed. We apply evolutionary algorithms in non-stationary problems. We extend the evolutionary algorithm by two mechanisms dedicated to non-stationary optimization: redundant genetic memory structures and a diversity maintenance technique -random inmigrants mechanism. We report on experiments with evolutionary optimization employing two mechanisms (separately and togheter); the results of experiments are discussed and some observations are made.
</summary>
<dc:date>2000-03-01T00:00:00Z</dc:date>
<dc:description>As most real-world problemas are dynamic, it is not sufficient to "solve" the problem for the some (current) scenario, but it is also necessary to modify the current solution due to various changes in the environment (e. g., machine breakdowns, sickness of employees, etc.). Thus it is important to investigate properties of adaptive algorithms which do not require re-start every time a change is recorded. In this paper such non-stationary problems (i. e., problems, which change in time) are considered. We describe different types of changes in the environment. A new model for non-stationary problems and a classifcation of these problems by the type of changes is proposed. We apply evolutionary algorithms in non-stationary problems. We extend the evolutionary algorithm by two mechanisms dedicated to non-stationary optimization: redundant genetic memory structures and a diversity maintenance technique -random inmigrants mechanism. We report on experiments with evolutionary optimization employing two mechanisms (separately and togheter); the results of experiments are discussed and some observations are made.</dc:description>
</entry>
<entry>
<title>&lt;i&gt;Studies in computer science. Parallel programming paradigm&lt;/i&gt;, Per Brinch Hansen: Prentice Hall, Englewood Cliffs, first edition</title>
<link href="http://sedici.unlp.edu.ar:80/handle/10915/9394" rel="alternate"/>
<author>
<name>De Giusti, Armando Eduardo</name>
</author>
<id>http://sedici.unlp.edu.ar:80/handle/10915/9394</id>
<updated>2019-06-15T20:02:42Z</updated>
<published>2000-01-01T00:00:00Z</published>
<summary type="text">Revision
Journal of Computer Science &amp; Technology; vol. 1, no. 2
In this book, Hansen presents a collection of structured multicomputer programs for computational science, with the unifying idea of programming paradigm.
</summary>
<dc:date>2000-01-01T00:00:00Z</dc:date>
<dc:description>In this book, Hansen presents a collection of structured multicomputer programs for computational science, with the unifying idea of programming paradigm.</dc:description>
</entry>
<entry>
<title>Agents as animated creature: an useful metaphor</title>
<link href="http://sedici.unlp.edu.ar:80/handle/10915/9393" rel="alternate"/>
<author>
<name>Rueda, Sonia Vivian</name>
</author>
<id>http://sedici.unlp.edu.ar:80/handle/10915/9393</id>
<updated>2019-06-15T20:02:41Z</updated>
<published>2000-01-01T00:00:00Z</published>
<summary type="text">Articulo
Journal of Computer Science &amp; Technology; vol. 1, no. 2
Agents repesent a new paradigm for developing software applications. In spite of the interest of this particular way of looking at problems, there is considerable discrepancy on exactly what is an agent and which are the attributes and properties that characterize them. The agent-based view offers not only a powerful repertoire of tools and techniques but also provides a powerfull metaphor that brings about a better conceptualization of the probelms in different areas of Computer Science. Many computational metaphors have become transparent. That fact has brought confusion to the use of some terms even at the velel of fundamental ideas. Mature science is supposed to converge on a theoretical characterization of the systems it studies. Instead computational approaches seem to be diverging, with no broad consensus on central concepts. In particular, the agent concept generates a good deal of controversy. We consider here a metaphor that has become close to invisible with the hope of clarifying it. This wiew knits together the different threads that make up the agent model and offers the animated metaphor as a coneptual tools for analysis, design and implementation of a diverse range of software applications. That a metaphor makes possible new ways of creating programs and, more broadly, new ways of thinking about programs.
</summary>
<dc:date>2000-01-01T00:00:00Z</dc:date>
<dc:description>Agents repesent a new paradigm for developing software applications. In spite of the interest of this particular way of looking at problems, there is considerable discrepancy on exactly what is an agent and which are the attributes and properties that characterize them. The agent-based view offers not only a powerful repertoire of tools and techniques but also provides a powerfull metaphor that brings about a better conceptualization of the probelms in different areas of Computer Science. Many computational metaphors have become transparent. That fact has brought confusion to the use of some terms even at the velel of fundamental ideas. Mature science is supposed to converge on a theoretical characterization of the systems it studies. Instead computational approaches seem to be diverging, with no broad consensus on central concepts. In particular, the agent concept generates a good deal of controversy. We consider here a metaphor that has become close to invisible with the hope of clarifying it. This wiew knits together the different threads that make up the agent model and offers the animated metaphor as a coneptual tools for analysis, design and implementation of a diverse range of software applications. That a metaphor makes possible new ways of creating programs and, more broadly, new ways of thinking about programs.</dc:description>
</entry>
<entry>
<title>The ant colony metaphor for multiple knapsack problem</title>
<link href="http://sedici.unlp.edu.ar:80/handle/10915/9392" rel="alternate"/>
<author>
<name>Cena, Marcelo Guillermo</name>
</author>
<author>
<name>Crespo, María Liz</name>
</author>
<author>
<name>Kavka, Carlos</name>
</author>
<author>
<name>Leguizamón, Mario Guillermo</name>
</author>
<id>http://sedici.unlp.edu.ar:80/handle/10915/9392</id>
<updated>2019-06-15T20:02:36Z</updated>
<published>2000-01-01T00:00:00Z</published>
<summary type="text">Articulo
Journal of Computer Science &amp; Technology; vol. 1, no. 2
This paper presents an Ant Colony Optimisation (ACO) model for the Multiple Knapsack Problem (MKP). The ACO algorithms, as well as other evolutionary metaphors, are being applied successfully to diverse heavily constrained problems: Travelling Salesman Problem, Quadratic Assignment Problem and Bin Packing Problem. An Ant System, the first ACO algorithm that we presented in this paper, is also considered a class of multiagent distributed algorithm for combinatorial optimisation. The principle of an ACO Algorithm is adapted to the MKP. We present some results regardin its perfomance against known optimun for different instances of MKP. The obtained results show the potential power of this particular evolutionary approach for optimisation problems.
</summary>
<dc:date>2000-01-01T00:00:00Z</dc:date>
<dc:description>This paper presents an Ant Colony Optimisation (ACO) model for the Multiple Knapsack Problem (MKP). The ACO algorithms, as well as other evolutionary metaphors, are being applied successfully to diverse heavily constrained problems: Travelling Salesman Problem, Quadratic Assignment Problem and Bin Packing Problem. An Ant System, the first ACO algorithm that we presented in this paper, is also considered a class of multiagent distributed algorithm for combinatorial optimisation. The principle of an ACO Algorithm is adapted to the MKP. We present some results regardin its perfomance against known optimun for different instances of MKP. The obtained results show the potential power of this particular evolutionary approach for optimisation problems.</dc:description>
</entry>
<entry>
<title>Logical foundations and implementation of an extension of temporal logic</title>
<link href="http://sedici.unlp.edu.ar:80/handle/10915/9391" rel="alternate"/>
<author>
<name>Cobo, María Laura</name>
</author>
<author>
<name>Augusto, Juan Carlos</name>
</author>
<id>http://sedici.unlp.edu.ar:80/handle/10915/9391</id>
<updated>2019-06-15T04:05:03Z</updated>
<published>2000-01-01T00:00:00Z</published>
<summary type="text">Articulo
Journal of Computer Science &amp; Technology; vol. 1, no. 2
The need of counting with the appropiate management of situations involving time an the motion of change, has been reconized as an important aspect in many Computer Science areas. This fact has made evident the need of tools to handle this kind of imformation. As a reflection of this relevance many temporal logic programming languages have been propose in the last few years. In particular, wel will present here a temporal logic programming called ETP. This language is based on the proposal prsented by Gabbay in (Gab87). The present article concerns the explanation of its logical foundations and the most important aspects of its implementation. We are going to leave out the interpreters implementation code of this new language for space reasons, although, the reader can find it in (Cob98). Initially we will present an abstract of Gabbays work in order to familiarize the reader with the language we are going to extend an we will explain the usefulness of such extension. As regards the extension, we will provide the extended logica in detail and the definition of the language taht take it as its base. We will also present the algorithm which provides answers for teh queries of this language. The algorithum will be accompanied by a demonstration to prove that it computes a total function. Finally some examples will be presented to show potential uses of the language, together with the analysis of the goals reached and teh remaining tasks.
</summary>
<dc:date>2000-01-01T00:00:00Z</dc:date>
<dc:description>The need of counting with the appropiate management of situations involving time an the motion of change, has been reconized as an important aspect in many Computer Science areas. This fact has made evident the need of tools to handle this kind of imformation. As a reflection of this relevance many temporal logic programming languages have been propose in the last few years. In particular, wel will present here a temporal logic programming called ETP. This language is based on the proposal prsented by Gabbay in (Gab87). The present article concerns the explanation of its logical foundations and the most important aspects of its implementation. We are going to leave out the interpreters implementation code of this new language for space reasons, although, the reader can find it in (Cob98). Initially we will present an abstract of Gabbays work in order to familiarize the reader with the language we are going to extend an we will explain the usefulness of such extension. As regards the extension, we will provide the extended logica in detail and the definition of the language taht take it as its base. We will also present the algorithm which provides answers for teh queries of this language. The algorithum will be accompanied by a demonstration to prove that it computes a total function. Finally some examples will be presented to show potential uses of the language, together with the analysis of the goals reached and teh remaining tasks.</dc:description>
</entry>
<entry>
<title>Image compression for medical diagnosis using neural networks</title>
<link href="http://sedici.unlp.edu.ar:80/handle/10915/9390" rel="alternate"/>
<author>
<name>Lanzarini, Laura Cristina</name>
</author>
<author>
<name>Vargas Camacho, María Teresa</name>
</author>
<author>
<name>Flores Badrán, Amado</name>
</author>
<author>
<name>De Giusti, Armando Eduardo</name>
</author>
<id>http://sedici.unlp.edu.ar:80/handle/10915/9390</id>
<updated>2019-06-15T04:04:59Z</updated>
<published>2000-01-01T00:00:00Z</published>
<summary type="text">Articulo
Journal of Computer Science &amp; Technology; vol. 1, no. 2
Images compression is a widely studied topic. Conventional situations offer variable compression ratios depending on the image in question and, in general, do not yield good results for images that are rich in tones. This work is an application of images compression of patient s computed tomographies using neural networks, which allows to carry out both compression and decompression of the images with a fixed ratio of 8:1 and a loss of 2%.
</summary>
<dc:date>2000-01-01T00:00:00Z</dc:date>
<dc:description>Images compression is a widely studied topic. Conventional situations offer variable compression ratios depending on the image in question and, in general, do not yield good results for images that are rich in tones. This work is an application of images compression of patient s computed tomographies using neural networks, which allows to carry out both compression and decompression of the images with a fixed ratio of 8:1 and a loss of 2%.</dc:description>
</entry>
<entry>
<title>Comparative analysis of the method of assignment by classes in GAVaPS</title>
<link href="http://sedici.unlp.edu.ar:80/handle/10915/9389" rel="alternate"/>
<author>
<name>Lanzarini, Laura Cristina</name>
</author>
<author>
<name>Sanz, Cecilia Verónica</name>
</author>
<author>
<name>Naiouf, Marcelo</name>
</author>
<author>
<name>Romero, Fernando</name>
</author>
<id>http://sedici.unlp.edu.ar:80/handle/10915/9389</id>
<updated>2019-06-15T04:04:56Z</updated>
<published>2000-01-01T00:00:00Z</published>
<summary type="text">Articulo
Journal of Computer Science &amp; Technology; vol. 1, no. 2
Three alternatives within the method of assignment by classes are presented for the calculation of individuals lifetime in genetic algorithms with varying population size. (GAVaPS). In the proposed strategy (assignment by classes) individuals are grouped according to their fitness. The purpose is to use the allowed range of lifetime values in a way which is more suitable to search the optimum than proportional, linear and bilinear strategies. A comparative study of three possibilities of assignment by classes as related to the traditional methods is carried out, and results are shown over five functions. Finally, some conclusions are presented, along with possible future lines of work.
</summary>
<dc:date>2000-01-01T00:00:00Z</dc:date>
<dc:description>Three alternatives within the method of assignment by classes are presented for the calculation of individuals lifetime in genetic algorithms with varying population size. (GAVaPS). In the proposed strategy (assignment by classes) individuals are grouped according to their fitness. The purpose is to use the allowed range of lifetime values in a way which is more suitable to search the optimum than proportional, linear and bilinear strategies. A comparative study of three possibilities of assignment by classes as related to the traditional methods is carried out, and results are shown over five functions. Finally, some conclusions are presented, along with possible future lines of work.</dc:description>
</entry>
<entry>
<title>On the implementation of the belief change operators</title>
<link href="http://sedici.unlp.edu.ar:80/handle/10915/9388" rel="alternate"/>
<author>
<name>Falappa, Marcelo Alejandro</name>
</author>
<author>
<name>Fermé, Eduardo L.</name>
</author>
<id>http://sedici.unlp.edu.ar:80/handle/10915/9388</id>
<updated>2019-06-15T04:04:54Z</updated>
<published>2000-01-01T00:00:00Z</published>
<summary type="text">Articulo
Journal of Computer Science &amp; Technology; vol. 1, no. 2
In this article we will introduce certain considerations that must be taken into account while implementing the change operations of the belief change theory. The abstract models of bellief change make no considerations in respecto to the internal structures of the beliefs that compound the knowledge of an agent, and much less take into account the computational complexity of the proposed algorithms. In this article we will explicitly introduce some of the inconveniences and the possible solutions that can be found while implementing the change operations. Firstly, we will introduce the different change operations of the AGM model. These operations are characterized by certain rationality postulates that determine their behavior on the knowledge level. This means that the change operations are specified entirely in terms of the knowledge content (beliefs), making no distinction between the explicit imformation and the implicit information. In second term, we will introduce the change operations applicable to knowledge bases (that is, finite sets not necessarily closed under logical cnsequence) in which the explicit beliefs of the konwledge base are clearly distinguished from the beliefs deduced from them. In this case the change operations are defined on a symbolic level, which contains, explicit references about the syntax of the sentences that compound the base. We will see how certain postulates defined on the knowledge level must be transfomed into less restrictive postulates with the objective of respecting the basic principles of the AGM model: minimun change, syntax irrelevancy and adequacity of konwledge representation. We will also introdece a meta-symbolic level where we preach about the behavior of the sentenes that compund a knowledge base, making no reference to its syntactic form. Lastly, we will analyze the change operations on the implementation level. On this level, it is necessary to make certain decision that are not considered not only on the knowledge level but also on the symbolic level. This analysis is of vital importance because the decisions that are made on the implementation level can have a strong impact on the knowledge level.
</summary>
<dc:date>2000-01-01T00:00:00Z</dc:date>
<dc:description>In this article we will introduce certain considerations that must be taken into account while implementing the change operations of the belief change theory. The abstract models of bellief change make no considerations in respecto to the internal structures of the beliefs that compound the knowledge of an agent, and much less take into account the computational complexity of the proposed algorithms. In this article we will explicitly introduce some of the inconveniences and the possible solutions that can be found while implementing the change operations. Firstly, we will introduce the different change operations of the AGM model. These operations are characterized by certain rationality postulates that determine their behavior on the knowledge level. This means that the change operations are specified entirely in terms of the knowledge content (beliefs), making no distinction between the explicit imformation and the implicit information. In second term, we will introduce the change operations applicable to knowledge bases (that is, finite sets not necessarily closed under logical cnsequence) in which the explicit beliefs of the konwledge base are clearly distinguished from the beliefs deduced from them. In this case the change operations are defined on a symbolic level, which contains, explicit references about the syntax of the sentences that compound the base. We will see how certain postulates defined on the knowledge level must be transfomed into less restrictive postulates with the objective of respecting the basic principles of the AGM model: minimun change, syntax irrelevancy and adequacity of konwledge representation. We will also introdece a meta-symbolic level where we preach about the behavior of the sentenes that compund a knowledge base, making no reference to its syntactic form. Lastly, we will analyze the change operations on the implementation level. On this level, it is necessary to make certain decision that are not considered not only on the knowledge level but also on the symbolic level. This analysis is of vital importance because the decisions that are made on the implementation level can have a strong impact on the knowledge level.</dc:description>
</entry>
<entry>
<title>Parallel defeasible argumentation</title>
<link href="http://sedici.unlp.edu.ar:80/handle/10915/9387" rel="alternate"/>
<author>
<name>García, Alejandro Javier</name>
</author>
<author>
<name>Simari, Guillermo Ricardo</name>
</author>
<id>http://sedici.unlp.edu.ar:80/handle/10915/9387</id>
<updated>2019-06-15T04:04:53Z</updated>
<published>2000-01-01T00:00:00Z</published>
<summary type="text">Articulo
Journal of Computer Science &amp; Technology; vol. 1, no. 2
Implicitly exploitable parallelism for Logic Programming has received ample attention. Defeasible Argutmentation is specially apt for this optimizing technique. Defeasible Logic Programming (DLP), which is based on a defeasible argumentation formalism, could take full advantage of this type of parallel evaluation to improve the computational response of its proof procedure. In a defeasible argumentation formalism, a conclusion q is accepted only when the argument A that supports q becomes a justification. To decide if an argument A is a justification a dialectical analysis is performed. This analysis considers arguments and counter-arguments. DLP extends conventional Logic Programming, capturing common sense reasoning features, and providing a knowledge representation language for defeasible argumentation. Since DLP is an extension of Logic Programming, the different types of parallelism studied for Logic Programming could be applied. We propose new sources of parallelism that can be implicitly exploited in the defeasible argumentation formalism implemented through DLP. Both the argumentation process and the dialectical analysis benefit from exploiting those sources of parallelism.
</summary>
<dc:date>2000-01-01T00:00:00Z</dc:date>
<dc:description>Implicitly exploitable parallelism for Logic Programming has received ample attention. Defeasible Argutmentation is specially apt for this optimizing technique. Defeasible Logic Programming (DLP), which is based on a defeasible argumentation formalism, could take full advantage of this type of parallel evaluation to improve the computational response of its proof procedure. In a defeasible argumentation formalism, a conclusion q is accepted only when the argument A that supports q becomes a justification. To decide if an argument A is a justification a dialectical analysis is performed. This analysis considers arguments and counter-arguments. DLP extends conventional Logic Programming, capturing common sense reasoning features, and providing a knowledge representation language for defeasible argumentation. Since DLP is an extension of Logic Programming, the different types of parallelism studied for Logic Programming could be applied. We propose new sources of parallelism that can be implicitly exploited in the defeasible argumentation formalism implemented through DLP. Both the argumentation process and the dialectical analysis benefit from exploiting those sources of parallelism.</dc:description>
</entry>
<entry>
<title>A criteria to select genetic operators for solving CSP</title>
<link href="http://sedici.unlp.edu.ar:80/handle/10915/9386" rel="alternate"/>
<author>
<name>Riff Rojas, María Cristina</name>
</author>
<id>http://sedici.unlp.edu.ar:80/handle/10915/9386</id>
<updated>2019-06-15T04:04:52Z</updated>
<published>2000-01-01T00:00:00Z</published>
<summary type="text">Articulo
Journal of Computer Science &amp; Technology; vol. 1, no. 2
Our interest is to define evolutionary algorithms to solve Constraint Satisfaction Problems (CSP), which indlude benefits of taditional resolution methods of CSPs as well as inherent characteristics of these kind of problems. In this paper we propose a criterion to be able to evaluate the perfomance of genetic operators within evolutionary algorithms that solve CSp.
</summary>
<dc:date>2000-01-01T00:00:00Z</dc:date>
<dc:description>Our interest is to define evolutionary algorithms to solve Constraint Satisfaction Problems (CSP), which indlude benefits of taditional resolution methods of CSPs as well as inherent characteristics of these kind of problems. In this paper we propose a criterion to be able to evaluate the perfomance of genetic operators within evolutionary algorithms that solve CSp.</dc:description>
</entry>
<entry>
<title>Self adaptation of parameters for MCPC in genetic algorithms</title>
<link href="http://sedici.unlp.edu.ar:80/handle/10915/9385" rel="alternate"/>
<author>
<name>Esquivel, Susana Cecilia</name>
</author>
<author>
<name>Leiva, Héctor Ariel</name>
</author>
<author>
<name>Gallard, Raúl Hector</name>
</author>
<id>http://sedici.unlp.edu.ar:80/handle/10915/9385</id>
<updated>2019-06-15T04:04:49Z</updated>
<published>2000-01-01T00:00:00Z</published>
<summary type="text">Articulo
Journal of Computer Science &amp; Technology; no. 2
As a new promising crossover method, multiple crossovers per couple (MCPC) deserves special attention in evolutionary computing field. Allowing multiple crossovers per couple on a selected pair of parents provided an extra benefit in processing time and similar quality of solutions when contrasted against the conventional single crossover per couple approach (SCPC). These results, were confirmed when optimising classic testing functions and harder (non-linear, non-separable) functions. Despite these benefits, due to a reinforcement of selective pressure, MCPC showed in some cases an undesirable premature convergence effect. In order to face this problem, the present paper attempts to control the number of crossovers, and offspring, allowed to the mating pair in a self-adaptive manner. Self-adaptation of parameters is a central feature of evolutionary strategies, another class of algorithms, which simultaneously apply evolutionary principles on the search space of object variables and on strategy parameters. In other words, parameter values are also submitted to the evolutionary process. This approach can be also applied to genetic algorithms. In the case of MCPC, the number of crossovers allowed to a selected couple is a key parameter and consequently self-adaptation is achieved by adding to the chromosome structure -labels- describing the number of crossover allowed to each individual. Labels, which are bit strings, also undergo crossover and mutation and consequently evolve together with the individual. During the stages of the evolution process, it is expected that the algorithm will return the number of crossovers for which the current population exhibits a better behaviour.
</summary>
<dc:date>2000-01-01T00:00:00Z</dc:date>
<dc:description>As a new promising crossover method, multiple crossovers per couple (MCPC) deserves special attention in evolutionary computing field. Allowing multiple crossovers per couple on a selected pair of parents provided an extra benefit in processing time and similar quality of solutions when contrasted against the conventional single crossover per couple approach (SCPC). These results, were confirmed when optimising classic testing functions and harder (non-linear, non-separable) functions. Despite these benefits, due to a reinforcement of selective pressure, MCPC showed in some cases an undesirable premature convergence effect. In order to face this problem, the present paper attempts to control the number of crossovers, and offspring, allowed to the mating pair in a self-adaptive manner. Self-adaptation of parameters is a central feature of evolutionary strategies, another class of algorithms, which simultaneously apply evolutionary principles on the search space of object variables and on strategy parameters. In other words, parameter values are also submitted to the evolutionary process. This approach can be also applied to genetic algorithms. In the case of MCPC, the number of crossovers allowed to a selected couple is a key parameter and consequently self-adaptation is achieved by adding to the chromosome structure -labels- describing the number of crossover allowed to each individual. Labels, which are bit strings, also undergo crossover and mutation and consequently evolve together with the individual. During the stages of the evolution process, it is expected that the algorithm will return the number of crossovers for which the current population exhibits a better behaviour.</dc:description>
</entry>
</feed>
