
Multilevel optimization in VLSICAD
Edición de la obra Multilevel optimization in VLSICAD
| Autor | Jason Cong |
|---|---|
| Editorial | Kluwer Academic Publishers |
| Fecha de publicación | 2003 |
| Lugar | Boston |
| Idioma | inglés |
| Páginas | 298 |
| ISBN-10 | 1402010818 |
| LCCN | 2002043252 |
| Serie | Combinatorial optimization -- v. 14 |
| Número de Cutter | C749m |
In the last few decades, multiscale algorithms have become a dominant trend in large-scale scientific computation. Researchers have successfully applied these methods to a wide range of simulation and optimization problems. This book gives a general overview of multiscale algorithms; applications to general combinatorial optimization problems such as graph partitioning and the traveling salesman problem; and VLSICAD applications, including circuit partitioning, placement, and VLSI routing. Additional chapters discuss optimization in reconfigurable computing, convergence in multilevel optimization, and model problems with PDE constraints. Audience: Written at the graduate level, the book is intended for engineers and mathematical and computational scientists studying large-scale optimization in electronic design automation.