Genetic algorithm introduction implementation de mahmud firoz (2 resultados)

Autor
Título
Refinar con la Búsqueda avanzada

Filtrar la búsqueda

  • Libros (2)

a

Intervalo de precios personalizado (EUR)

a

  • Idioma: Inglés

    Editorial: LAP LAMBERT Academic Publishing, 2012

    3848444488 / 9783848444489

    • Tapa blanda

    Librería: Mispah books, Redhill, SURRE, Reino UnidoMispah books

    Vendedor de 4 estrellas
    Contactar con el vendedor

    Condición: Usado - Como Nuevo

    EUR 162,16

    Envío por EUR 29,15 
    Se envía de Reino Unido a Estados Unidos de America

    Cantidad disponible: 1 disponibles

    Paperback. Condición: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

  • Idioma: Inglés

    Editorial: LAP Lambert Academic Publishing, 2012

    3848444488 / 9783848444489

    • Tapa blanda
    • Impresión bajo demanda

    Librería: AHA-BUCH GmbH, Einbeck, AlemaniaAHA-BUCH GmbH

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 70,99

    Envío por EUR 30,50 
    Se envía de Alemania a Estados Unidos de America

    Cantidad disponible: 2 disponibles

    Taschenbuch. Condición: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Now a day s Genetic Algorithms (GAs) become a rapidly growing field of computer science. In a Genetic Algorithms (GAs) have many fields to consider for development and have a lot of properties that makes it a good choice when one needs to solve very complicated problems. The performance of genetic algorithms is varied for different parameters that are used. So optimization of a problem by using Genetic algorithms (GAs) is one of the most popular research fields. One of the reasons for this is because of the complicated relation between the parameters and factors such as the complexity of the problem. From the various parameters if we take time constraints as a parameter then what happen, this is our key point for this work. One of the most important parameters is population size and we have found by testing a well known set of optimization benchmark problems that the optimal population size is not the same when time constraints were involved.