Handbook of Research on Fireworks Algorithms and Swarm Intelligence (Hardcover)

In recent years, swarm intelligence has become a popular computational approach among researchers working on optimization problems throughout the globe. Several algorithms inside swarm intelligence have been implemented due to their application to real-world issues and other advantages. A specific procedure, Fireworks Algorithm, is an emerging method that studies the explosion process of fireworks within local areas. Applications of this developing program are undiscovered, and research is necessary for scientists to fully understand the workings of this innovative system. The Handbook of Research on Fireworks Algorithms and Swarm Intelligence is a pivotal reference source that provides vital research on theory analysis, improvements, and applications of fireworks algorithm. While highlighting topics such as convergence rate, parameter applications, and global optimization analysis, this publication explores up-to-date progress on the specific techniques of this algorithm. This book is ideally designed for researchers, data scientists, mathematicians, engineers, software developers, postgraduates, and academicians seeking coverage on this evolutionary computation method.

General

Imprint:	Business Science Reference
Country of origin:	United States
Release date:	December 2019
Editors:	Ying Tan
Dimensions:	279 x 216mm (L x W)
Format:	Hardcover
Pages:	400
ISBN-13:	978-1-79981-659-1
Categories:	Books > Computing & IT > General theory of computing > Data structures Books > Computing & IT > Computer programming > Algorithms & procedures Books > Computing & IT > Applications of computing > Artificial intelligence > General Promotions
LSN:	1-79981-659-1
Barcode:	9781799816591

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!