Литмир - Электронная Библиотека
Nature-Inspired Optimization Algorithms
Добавить похожую книгу
Key Chiral Auxiliary Applications
Автор: Roos Gregory (EN)
Похожа
Непохожа
Battle for Syria, 1918-1920
Похожа
Непохожа
Mobile Handset Design
Похожа
Непохожа
Fundamental Analysis For Dummies
Автор: Krantz Matt (EN)
Похожа
Непохожа
Battery Operated Devices and Systems
Похожа
Непохожа
Dark Nights Of The Soul
Автор: Moore Thomas (EN)
Похожа
Непохожа
Nature-Inspired Optimization Algorithms
Author:Yang Xin-She (EN)
Language of a book: Английский
Language of an original book: Английский
Publisher: Gardners Books

    Nature-Inspired Optimization Algorithms provides a systematic introduction to all major nature-inspired algorithms for optimization. The book's unified approach, balancing algorithm introduction, theoretical background and practical implementation, complements extensive literature with well-chosen case studies to illustrate how these algorithms work. Topics include particle swarm optimization, ant and bee algorithms, simulated annealing, cuckoo search, firefly algorithm, bat algorithm, flower algorithm, harmony search, algorithm analysis, constraint handling, hybrid methods, parameter tuning and control, as well as multi-objective optimization. This book can serve as an introductory book for graduates, doctoral students and lecturers in computer science, engineering and natural sciences. It can also serve a source of inspiration for new applications. Researchers and engineers as well as experienced experts will also find it a handy reference.Discusses and summarizes the latest developments in nature-inspired algorithms with comprehensive, timely literatureProvides a theoretical understanding as well as practical implementation hintsProvides a step-by-step introduction to each algorithm

    Поделиться:
    ]]>Facebook :0]]>  ]]>Twitter :0]]>  ]]>В контакте :0]]>  ]]>Livejournal :0]]>  ]]>Мой мир :0]]>  ]]>Gmail :0]]>  Email :0  ]]>Скачать :0]]>  
    Мой статус книги:
    Чтобы оставить свою оценку и отзывы вам нужно зайти на сайт или зарегистрироваться

    {"b":"307517","o":30}