Evolutionary Algorithms for VLSI CAD

Drechsler, Rolf

ISBN 10: 0792381688 / ISBN 13: 9780792381686

Edité par Springer, 1998

A propos de cet article

Very Good text and cover, minor reading wear to text and covers/edges. US orders shipped via US Mail. International orders shipped via DHL. Additional postage may be required on oversize books and sets. N° de réf. du vendeur 2412200044

Détails bibliographiques

Titre : Evolutionary Algorithms for VLSI CAD

Éditeur : Springer

Date d'édition : 1998

Reliure : hardcover

Etat : Very Good

A propos de ce titre

Synopsis :

In VLSI CAD, difficult optimization problems have to be solved on a constant basis. Various optimization techniques have been proposed in the past. While some of these methods have been shown to work well in applications and have become somewhat established over the years, other techniques have been ignored.
Recently, there has been a growing interest in optimization algorithms based on principles observed in nature, termed Evolutionary Algorithms (EAs).
Evolutionary Algorithms in VLSI CAD presents the basic concepts of EAs, and considers the application of EAs in VLSI CAD. It is the first book to show how EAs could be used to improve IC design tools and processes. Several successful applications from different areas of circuit design, like logic synthesis, mapping and testing, are described in detail.
Evolutionary Algorithms in VLSI CAD consists of two parts. The first part discusses basic principles of EAs and provides some easy-to-understand examples. Furthermore, a theoretical model for multi-objective optimization is presented. In the second part a software implementation of EAs is supplied together with detailed descriptions of several EA applications. These applications cover a wide range of VLSI CAD, and different methods for using EAs are described.
Evolutionary Algorithms in VLSI CAD is intended for CAD developers and researchers as well as those working in evolutionary algorithms and techniques supporting modern design tools and processes.