VLSI cell placement techniques
K Shahookar, P Mazumder - ACM Computing Surveys (CSUR), 1991 - dl.acm.org
VLSI cell placement problem is known to be NP complete. A wide repertoire of heuristic
algorithms exists in the literature for efficiently arranging the logic cells on a VLSI chip. The …
algorithms exists in the literature for efficiently arranging the logic cells on a VLSI chip. The …
A survey of computational approaches to three-dimensional layout problems
The component layout or packaging problem requires efficient search of large,
discontinuous spaces. This survey paper reviews the state-of-the-art in product layout …
discontinuous spaces. This survey paper reviews the state-of-the-art in product layout …
Robot motion planning: A distributed representation approach
J Barraquand, JC Latombe - The International Journal of …, 1991 - journals.sagepub.com
We propose a new approach to robot path planning that consists of building and searching a
graph connecting the local minima of a potential function defined over the robot's …
graph connecting the local minima of a potential function defined over the robot's …
Wallplan: synthesizing floorplans by learning to generate wall graphs
Floorplan generation has drawn widespread interest in the community. Recent learning-
based methods for generating realistic floorplans have made significant progress while a …
based methods for generating realistic floorplans have made significant progress while a …
A deep reinforcement learning approach for global routing
Global routing has been a historically challenging problem in the electronic circuit design,
where the challenge is to connect a large and arbitrary number of circuit components with …
where the challenge is to connect a large and arbitrary number of circuit components with …
[图书][B] Reconfigurable computing: Accelerating computation with field-programmable gate arrays
MB Gokhale, PS Graham - 2006 - books.google.com
A one-of-a-kind survey of the field of Reconfigurable Computing Gives a comprehensive
introduction to a discipline that offers a 10X-100X acceleration of algorithms over …
introduction to a discipline that offers a 10X-100X acceleration of algorithms over …
Optimal groundwater management: 1. Simulated annealing
DE Dougherty, RA Marryott - Water Resources Research, 1991 - Wiley Online Library
Simulated annealing is introduced and applied to the optimization of groundwater
management problems cast in combinatorial form. This heuristic, probabilistic optimization …
management problems cast in combinatorial form. This heuristic, probabilistic optimization …
Droplet routing in the synthesis of digital microfluidic biochips
Recent advances in microfluidics are expected to lead to sensor systems for high-throughput
biochemical analysis. CAD tools are needed to handle increased design complexity for such …
biochemical analysis. CAD tools are needed to handle increased design complexity for such …
A new class of iterative Steiner tree heuristics with good performance
A fast approach to the minimum rectilinear Steiner tree (MRST) problem is presented. The
method yields results that reduce wire length by up to 2% to 3% over the previous methods …
method yields results that reduce wire length by up to 2% to 3% over the previous methods …
[图书][B] Digital microfluidic biochips: synthesis, testing, and reconfiguration techniques
K Chakrabarty, F Su - 2018 - taylorfrancis.com
Digital Microfluidic Biochips focuses on the automated design and production of microfluidic-
based biochips for large-scale bioassays and safety-critical applications. Bridging areas of …
based biochips for large-scale bioassays and safety-critical applications. Bridging areas of …