Kirjojen hintavertailu. Mukana 12 595 353 kirjaa ja 12 kauppaa.

Kirjailija

Seán McGarraghy

Kirjat ja teokset yhdessä paikassa: 4 kirjaa, julkaisuja vuosilta 2015-2019, suosituimpien joukossa Natural Computing Algorithms. Vertaile teosten hintoja ja tarkista saatavuus suomalaisista kirjakaupoista.

4 kirjaa

Kirjojen julkaisuhaarukka 2015-2019.

Foraging-Inspired Optimisation Algorithms

Foraging-Inspired Optimisation Algorithms

Anthony Brabazon; Seán McGarraghy

Springer Nature Switzerland AG
2019
nidottu
This book is an introduction to relevant aspects of the foraging literature for algorithmic design, and an overview of key families of optimization algorithms that stem from a foraging metaphor. The authors first offer perspectives on foraging and foraging-inspired algorithms for optimization, they then explain the techniques inspired by the behaviors of vertebrates, invertebrates, and non-neuronal organisms, and they then discuss algorithms based on formal models of foraging, how to evolve a foraging strategy, and likely future developments.No prior knowledge of natural computing is assumed. This book will be of particular interest to graduate students, academics and practitioners in computer science, informatics, data science, management science, and other application domains.
Foraging-Inspired Optimisation Algorithms

Foraging-Inspired Optimisation Algorithms

Anthony Brabazon; Seán McGarraghy

Springer International Publishing AG
2018
sidottu
This book is an introduction to relevant aspects of the foraging literature for algorithmic design, and an overview of key families of optimization algorithms that stem from a foraging metaphor. The authors first offer perspectives on foraging and foraging-inspired algorithms for optimization, they then explain the techniques inspired by the behaviors of vertebrates, invertebrates, and non-neuronal organisms, and they then discuss algorithms based on formal models of foraging, how to evolve a foraging strategy, and likely future developments.No prior knowledge of natural computing is assumed. This book will be of particular interest to graduate students, academics and practitioners in computer science, informatics, data science, management science, and other application domains.
Natural Computing Algorithms

Natural Computing Algorithms

Anthony Brabazon; Michael O'Neill; Seán McGarraghy

Springer-Verlag Berlin and Heidelberg GmbH Co. K
2016
nidottu
The field of natural computing has been the focus of a substantial research effort in recent decades. One particular strand of this research concerns the development of computational algorithms using metaphorical inspiration from systems and phenomena that occur in the natural world. These naturally inspired computing algorithms have proven to be successful problem-solvers across domains as diverse as management science, bioinformatics, finance, marketing, engineering, architecture and design.This book is a comprehensive introduction to natural computing algorithms, suitable for academic and industrial researchers and for undergraduate and graduate courses on natural computing in computer science, engineering and management science.
Natural Computing Algorithms

Natural Computing Algorithms

Anthony Brabazon; Michael O'Neill; Seán McGarraghy

Springer-Verlag Berlin and Heidelberg GmbH Co. K
2015
sidottu
The field of natural computing has been the focus of a substantial research effort in recent decades. One particular strand of this research concerns the development of computational algorithms using metaphorical inspiration from systems and phenomena that occur in the natural world. These naturally inspired computing algorithms have proven to be successful problem-solvers across domains as diverse as management science, bioinformatics, finance, marketing, engineering, architecture and design.This book is a comprehensive introduction to natural computing algorithms, suitable for academic and industrial researchers and for undergraduate and graduate courses on natural computing in computer science, engineering and management science.