skip to main content
Idioma:

Evolution and biocomputation computational models of evolution

Wolfgang Banzhaf 1955-; Frank H Eeckman

Berlin New York Springer c1995

Localização: FCFRP - Fac. Ciên. Farm. Ribeirão Preto    (616:681.3 E92 ) e outros locais(Acessar)

  • Título:
    Evolution and biocomputation computational models of evolution
  • Autor: Wolfgang Banzhaf 1955-; Frank H Eeckman
  • Assuntos: Population genetics -- Mathematical models; Evolution -- Mathematical models; Population genetics -- Computer simulation; Evolution -- Computer simulation; Quantitative genetics; ALGORITMOS GENÉTICOS; COMBINATÓRIA; COLETÂNEA
  • Notas: Includes bibliographical references and index
  • Notas Locais: Serie : lecture notes in computer science, 899
  • Descrição: Aspects of optimality behavior in population genetics theory / W.J. Ewens and A. Hastings -- Optimization as a technique for studying population genetics equations / A. Hastings and G.A. Fox -- Emergence of mutualism / G. Duchateau-Nguyen, G. Weisbuch and L. Peliti -- Three illustrations of artificial life's working hypothesis / M.A. Bedau -- Self-organizing algorithms derived from RNA interactions / W. Banzhaf -- Modeling the connection between development and evolution : preliminary report / E. Mjolsness ... [et al.] -- Soft genetic operators in evolutionary algorithms / H.-M. Voigt -- Analysis of selection, mutation and recombination in genetic algorithms / H. Mühlenbein and D. Schlierkamp-Voosen -- The role of mate choice in biocomputation : sexual selection as a process of search, optimization and diversification / G.F. Miller and P.M. Todd -- Genome growth and the evolution of the genotype-phenotype map / L. Altenberg
  • Títulos relacionados: Série:Lecture notes in computer science 899
  • Editor: Berlin New York Springer
  • Data de criação/publicação: c1995
  • Formato: vi, 277 p. ill. 24 cm.
  • Idioma: Inglês
Links
Voltar para lista de resultados

  • Realização: ABCD-USP USP   Logos de Redes Sociais: Freepik

Buscando em bases de dados remotas. Favor aguardar.