TEST - Catálogo BURRF
   

Foundations of Generic Optimization : Volume 1: A Combinatorial Approach to Epistasis / by M. Iglesias, B. Naudts, A. Verschoren, C. Vidal ; edited by R. Lowen, A. Verschoren.

Por: Colaborador(es): Tipo de material: TextoTextoSeries Mathematical Modelling: Theory and Applications ; 20Editor: Dordrecht : Springer Netherlands, 2005Descripción: xiii, 296 páginas recurso en líneaTipo de contenido:
  • texto
Tipo de medio:
  • computadora
Tipo de portador:
  • recurso en línea
ISBN:
  • 9781402036651
Formatos físicos adicionales: Edición impresa:: Sin títuloClasificación LoC:
  • QA76.9.M35
Recursos en línea:
Contenidos:
Genetic algorithms: a guide for absolute beginners -- Evolutionary algorithms and their theory -- Epistasis -- Examples -- Walsh transforms -- Multary epistasis -- Generalized Walsh transforms.
Resumen: The success of a genetic algorithm when applied to an optimization problem depends upon several features present or absent in the problem to be solved, including the quality of the encoding of data, the geometric structure of the search space, deception or epistasis. This book deals essentially with the latter notion, presenting for the first time a complete state-of-the-art research on this notion, in a structured completely self-contained and methodical way. In particular, it contains a refresher on the linear algebra used in the text as well as an elementary introductory chapter on genetic algorithms aimed at readers unacquainted with this notion. In this way, the monograph aims to serve a broad audience consisting of graduate and advanced undergraduate students in mathematics and computer science, as well as researchers working in the domains of optimization, artificial intelligence, theoretical computer science, combinatorics and evolutionary algorithms.
Valoración
    Valoración media: 0.0 (0 votos)
No hay ítems correspondientes a este registro

Springer eBooks

Genetic algorithms: a guide for absolute beginners -- Evolutionary algorithms and their theory -- Epistasis -- Examples -- Walsh transforms -- Multary epistasis -- Generalized Walsh transforms.

The success of a genetic algorithm when applied to an optimization problem depends upon several features present or absent in the problem to be solved, including the quality of the encoding of data, the geometric structure of the search space, deception or epistasis. This book deals essentially with the latter notion, presenting for the first time a complete state-of-the-art research on this notion, in a structured completely self-contained and methodical way. In particular, it contains a refresher on the linear algebra used in the text as well as an elementary introductory chapter on genetic algorithms aimed at readers unacquainted with this notion. In this way, the monograph aims to serve a broad audience consisting of graduate and advanced undergraduate students in mathematics and computer science, as well as researchers working in the domains of optimization, artificial intelligence, theoretical computer science, combinatorics and evolutionary algorithms.

Para consulta fuera de la UANL se requiere clave de acceso remoto.

Universidad Autónoma de Nuevo León
Secretaría de Extensión y Cultura - Dirección de Bibliotecas @
Soportado en Koha