This Book >>

  • 190pp. Published November 2011
  • Scientific Research Publishing
  • Category: Computer Science & Communications
  • ISBN: 978-1-935068-58-7
  • (Paperback) USD 89.00
  • ISBN: 978-1-61896-057-3
  • (E-Book) USD 30.00

Connect with SCIRP >>

Contact Us >>

WhatsApp  +86 18163351462(WhatsApp)
   
Paper Publishing WeChat
Book Publishing WeChat
(or Email:book@scirp.org)
Home > Books > Optimization in computer engineering – T...
Optimization in computer engineering – Theory and applications
  • Description
  • E-Book
  • Author(s) Information

The aim of this book is to provide an overview of classic as well as new research results on optimization problems and algorithms. Beside the theoretical basis, the book contains a number of chapters describing the application of the theory in practice, that is, reports on successfully solving real-world engineering challenges by means of optimization algorithms. These case studies are collected from a wide range of application domains within computer engineering. The diversity of the presented approaches offers a number of practical tips and insights into the practical application of optimization algorithms, highlighting real-world challenges and solutions. Researchers, practitioners and graduate students will find the book equally useful.

Components of the Book:
  • FRONT MATTER
  • Chapter 1 Introduction
    • Preliminaries
    • Acknowledgement
  • Chapter 2 Fundamentals of Optimization Algorithms
    • Algorithmic Problems
    • Algorithms
    • Complexity of Algorithms
    • Conclusion
    • Bibliography
  • Chapter 3 Some Common Combinatorial Problems and Algorithms
    • Algorithmic Problems in Graph Theory
    • Constraint Satisfaction
    • Conclusion
    • Bibliography
  • Chapter 4 Recent Advances in Typical-Case Complexity
    • Introduction
    • Heavy-Tailed Runtime Distributions
    • Frequent Restarts
    • Phase Transition
    • Empirical Hardness Models
    • Algorithm Portfolios
    • Conclusion
    • Bibliography
  • Chapter 5 Metric-Based Approximation Algorithms for Graph Cut Problems
    • Introduction
    • Preliminaries
    • Shortest-Paths Metrics
    • Spreading Metrics
    • lp-Embeddings
    • Conclusions and Open Problems
    • Bibliography
  • Chapter 6 Optimization Issues on the Motion Planning of Kinematically Redundant Manipulators
    • Introduction
    • Inverse Manipulator Jacobian
    • Redundancy Resolution
    • Singularities
    • Other Methods
    • Simulation Results
    • Conclusion
    • Acknowledgements
    • Bibliography
  • Chapter 7 Suboptimal Robot Team Coordination
    • Introduction
    • The Game Theoretic Framework and Strategies
    • Weight Tuning with Fuzzy PD Controller
    • Coordination of High Level Tactical Maneuvers
    • Conclusion
    • Acknowledgements
    • Bibliography
  • Chapter 8 Applying Graph Coloring to Frequency Assignment
    • Introduction
    • Graph Coloring
    • The Frequency Assignment Problem
    • Solution of FAPs with Graph Coloring
    • Empirical Measurements
    • Conclusion
    • Acknowledgements
    • Bibliography
  • Chapter 9 Routing in the 3-Dimensional Grid
    • Introduction
    • Basic Definitions
    • Single Active Layer Routing
    • 3-Dimensional Channel Routing
    • Conclusion
    • Acknowledgements
    • Bibliography
  • Chapter 10 Total Variation Regularization in Maximum Likelihood Estimation
    • Introduction
    • Maximum Likelihood Estimation
    • Total Variation Regularization
    • Application to Positron Emission Tomography
    • Conclusions
    • Acknowledgements
    • Bibliography
Readership: Researchers, practitioners and graduate students will find the book equally useful.
comments powered by Disqus