This survey describes research directions in netlist partitioning during the past two decades
in terms of both problem formulations and solution approaches. We discuss the traditional …

Metaheuristics are the most exciting development in approximate optimization techniques of
the last two decades. They have had widespread successes in attacking a variety of difficult …

Since their introduction in 1984, Field-Programmable Gate Arrays (FPGAs) have become
one of the most popular implementation media for digital circuits and have grown into a $2 …

Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …

This book provides broad and comprehensive coverage of the entire EDA flow. EDA/VLSI
practitioners and researchers in need of fluency in an" adjacent" field will find this an …

Hybrid genetic algorithms (GAs) for the graph partitioning problem are described. The
algorithms include a fast local improvement heuristic. One of the novel features of these …

(57) ABSTRACT A method of automatically placing transistors of a folded transistor circuit for
Synthesizing rows of transistors in a Semiconductor layout (172). First, an initial placement …

1998-01-09 Assigned to RELAY DESIGN AUTOMATION INCORPORATED reassignment
RELAY DESIGN AUTOMATION INCORPORATED ASSIGNMENT OF ASSIGNORS …

We present a new force directed method for global placement. Besides the well-known wire
length dependent forces we use additional forces to reduce cell overlaps and to consider the …

The advances in the programmable hardware have lead to new architectures, where the
hardware can be dynamically adapted to the application to gain better performance. One of …