The aims of this chapter are twofold: to provide a succinct introduction to Evolutionary Computing, outlining the main technical details, and to raise issues pertinent to musical applications of the methodology. Thus this article should furnish readers with the necessary background needed to understand the remaining chapters, as well as opening up a number of important themes relevant to this c...

This paper aims at studying the interaction between the extraction of interscheme properties, such as synonymies, homonymies and type conflicts (which are exploited for dejining the semantics of involved schemes for integration purposes), and the resolution of type conjlicts. As a matter of facts, the transformations required by type conflict resolution could invalidate some of the detected int...

This paper develops an evolutionary method that learns inductively to recognize the makeup and the position of very short consensus sequences, which are a typical feature of promoters in eukaryotic genomes. This class of method can be used to discover candidate promoter sequences in primary sequence data. If further developed, it has the potential to discover genes which are regulated together.

als 8 Millionen Produkte.

Since the early 1990s the field of Evolutionary Computation has experienced a tremendous growth of interest resulting in many new ideas, new algorithms and new applications. This growth is both a blessing and a curse. It serves as strong evidence of the usefulness of these techniques, but makes it difficult to see “the big picture” regarding how the many instances of evolutionary algorithms rel...

This report represents an initial investigation into the use of genetic programming to solve the N-prisoners puzzle. The puzzle has generated a certain level of interest among the mathematical community. We believe that this puzzle presents a significant challenge to the field of evolutionary computation and to genetic programming in particular. The overall aim is to generate a solution that en...

The use of general descriptive names, registered names, trademarks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use.