Mohlo by sa vám tiež páčiť

Viac informácií o knihe Intelligent Evolutionary Optimization

• Parametre knihy
• Anotácia kniha
• Obľúbené z iného súdka

Nákupom získate 555 bodov

Anotácia knihy

Intelligent Evolutionary Optimization introduces biologically-inspired intelligent optimization algorithms to address complex optimization problems and provide practical solutions for tackling combinatorial optimization problems. The book explores efficient search and optimization methods in high-dimensional spaces, particularly for high-dimensional multi-objective optimization problems, offering practical guidance and effective solutions across various domains. Providing practical solutions, methods, and tools to tackle complex optimization problems and enhance modern optimization techniques, this book will be a valuable resource for professionals seeking to enhance their understanding and proficiency in intelligent evolutionary optimization. • Introduces biologically-inspired intelligent optimization algorithms capable of effectively solving complex optimization problems, teaching readers how to apply these algorithms and improve existing optimization techniques• Explores multi-objective optimization problems in high-dimensional spaces for readers to understand how to perform efficient search and optimization, acquiring strategies and tools adapted to high-dimensional environments• Presents the practical applications of intelligent evolutionary optimization in various fields to help readers gain insights into the latest trends and application scenarios in the field and receive practical guidance and solutions

Parametre knihy

Zaradenie knihy Knihy po anglicky Computing & information technology Computer science Artificial intelligence

• Celý názov: Intelligent Evolutionary Optimization
• Autor: Hua Xu, Yuan Yuan
• Jazyk: Angličtina
• Väzba: Brožovaná
• Počet strán: 350
• EAN: 9780443274008
• ISBN: 0443274002
• ID: 44574610
• Nakladateľ: Elsevier Inc
• Hmotnosť: 661 g
• Rozmery: 235 × 191 mm
• Dátum vydania: 01. June 2024

---

---

---