Table of contents
About this book
Learning methods and approximation algorithms are fundamental tools that deal with computationally hard problems and problems in which the input is gradually disclosed over time. Both kinds of problems have a large number of applications arising from a variety of fields, such as algorithmic game theory, approximation classes, coloring and partitioning, competitive analysis, computational finance, cuts and connectivity, geometric problems, inapproximability results, mechanism design, network design, packing and covering, paradigms for design and analysis of approximation and online algorithms, randomization techniques, real-world applications, scheduling problems and so on. The past years have witnessed a large number of interesting applications using various techniques of Computational Intelligence such as rough sets, connectionist learning; fuzzy logic; evolutionary computing; artificial immune systems; swarm intelligence; reinforcement learning, intelligent multimedia processing etc.. In spite of numerous successful applications of Computational Intelligence in business and industry, it is sometimes difficult to explain the performance of these techniques and algorithms from a theoretical perspective. Therefore, we encouraged authors to present original ideas dealing with the incorporation of different mechanisms of Computational Intelligent dealing with Learning and Approximation algorithms and underlying processes.
This edited volume comprises 15 chapters, including an overview chapter, which provides an up-to-date and state-of-the art research on the application of Computational Intelligence for learning and approximation.
Editors and affiliations
- DOI https://doi.org/10.1007/978-3-642-01082-8
- Copyright Information Springer Berlin Heidelberg 2009
- Publisher Name Springer, Berlin, Heidelberg
- eBook Packages Engineering
- Print ISBN 978-3-642-01081-1
- Online ISBN 978-3-642-01082-8
- Series Print ISSN 1860-949X
- Series Online ISSN 1860-9503
- About this book