Algorithmic Intelligence
Springer International Publishing (Verlag)
978-3-319-65595-6 (ISBN)
In this book the author argues that the basis of what we consider computer intelligence has algorithmic roots, and he presents this with a holistic view, showing examples and explaining approaches that encompass theoretical computer science and machine learning via engineered algorithmic solutions.
Part I of the book introduces the basics. The author starts with a hands-on programming primer for solving combinatorial problems, with an emphasis on recursive solutions. The other chapters in the first part of the book explain shortest paths, sorting, deep learning, and Monte Carlo search.
A key function of computational tools is processing Big Data efficiently, and the chapters in Part II of the book examine traditional graph problems such as finding cliques, colorings, independent sets, vertex covers, and hitting sets, and the subsequent chapters cover multimedia, network, image, and navigation data.
The highly topical research areas detailed in Part IIIare machine learning, problem solving, action planning, general game playing, multiagent systems, and recommendation and configuration.
Finally, in Part IV the author uses application areas such as model checking, computational biology, logistics, additive manufacturing, robot motion planning, and industrial production to explain how the techniques described may be exploited in modern settings.
The book is supported with a comprehensive index and references, and it will be of value to researchers, practitioners, and students in the areas of artificial intelligence and computational intelligence.
Stefan Edelkamp is currently a professor at the Institute for Artificial Intelligence, Faculty of Computer Science and Mathematics of the University of Bremen, and at the University of Applied Science in Darmstadt. He earned his Ph.D. from Freiburg University. His main scientific interest is algorithmic intelligence, which encompasses areas such as heuristic search, action planning, game playing, machine learning, motion planning, multi-agent simulation, model checking, distributed computing, algorithm engineering, and computational biology.
Preface.- Towards a Characterization.- Part I, Basics.- 1. Programming Primer.- 2. Shortest Paths.- 3. Sorting.- 4. Deep Learning.- 5. Monte-Carlo Search.- Part II, Big Data.- 6. Graph data.- 7. Multimedia Data.- 8. Network Data.- 9. Image Data.- 10. Navigation Data.- Part III, Research Areas.- 11. Machine Learning.- 12. Problem Solving.- 13. Card Game Playing.- 14. Action Planning.- 15. General Game Playing.- 16. Multiagent Systems.- 17. Recommendation and Configuration Part IV, Applications.- 18. Adversarial Planning.- 19. Model Checking.- 20. Computational Biology.- 21. Logistics.- 22. Additive Manufacturing.- 23. Robot Motion Planning.- 24. Industrial Production.- 25. Further Application Areas. - Index and References
Erscheinungsdatum | 01.06.2023 |
---|---|
Zusatzinfo | XXV, 467 p. 173 illus., 90 illus. in color. |
Verlagsort | Cham |
Sprache | englisch |
Maße | 210 x 279 mm |
Gewicht | 1379 g |
Themenwelt | Informatik ► Theorie / Studium ► Künstliche Intelligenz / Robotik |
Schlagworte | Adversarial Planning • Algorithm Engineering • Artificial Intelligence • Artificial Intelligence (AI) • artificial intelligence (incl. robotics) • automatic control engineering • Big Data • Big Data/Analytics • business mathematics & systems • Business mathematics & systems • Computational Biology • Computational Biology/Bioinformatics • Computer Science • Control, Robotics, Mechatronics • Data Mining • data mining and knowledge discovery • Deep learning • electronic devices & materials • Electronic devices & materials • Expert systems / knowledge-based systems • game playing • Games • Information technology: general issues • Life sciences: general issues • logistics • machine learning • Motion Planning • Multiagent Systems • Navigation • Network Security • Recommender Systems • Robotics • Robot Motion Planning • sorting |
ISBN-10 | 3-319-65595-7 / 3319655957 |
ISBN-13 | 978-3-319-65595-6 / 9783319655956 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
aus dem Bereich