2 869 855 libros electrónicos en 110 idiomas
¿No le conviene? No hay problema. Puedes devolver los artículos hasta 30 días
No se equivocará con un vale de regalo. El destinatario puede elegir cualquier producto de nuestra oferta.
Hasta 30 días para devoluciones
Evolutionary algorithms (EAs) are a highly successful tool commonly used in practice to solve algorithmic problems. This remarkable practical value, however, is not backed up by a deep theoretical understanding. Such an understanding would facilitate the application of EAs to further problems. Runtime analyses of EAs are one way to expand the theoretical knowledge in this field. This thesis presents runtime analyses for three prominent problems in combinatorial optimization, namely the Single Source Shortest Path problem, the All-Pairs Shortest Path problem, and the Sorting problem. Additionally, it provides probability theoretical tools that will simplify future runtime analyses of EAs.
¡Hola! Soy Libroamiko, tu asesor de libros.
¿Cómo puedo ayudarte?