J. P. Blanks, "Near-optimal placement using a quadratic objective function, " in Proc. IEEE Design Automation Conf., 1985, pp. 609--615. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Parallel Algorithms For Placement And Routing In VLSI Design - Brouwer (1991) (Correct)
....2.2. Example of a standard cell design locations of the cells that have previously been placed. Specific examples of constructive placement methods include (1) cluster growth [12] 2) partitioning of components [13 16] 3) global placement by quadratic assignment or convex function optimization [17, 18], and (4) artificial intelligence planning [19] Iterative methods attempt to alter a complete placement of the cells to attain any amount of improvement in the placement. Specific examples of iterative improvement placement include (1) successive overrelaxation [20] 2) simulated annealing ....
J. P. Blanks, "Near-optimal placement using a quadratic objective function," Proc. 21st Design Automat. Conf., pp. 602-615, June 1985.
An Industrial View of Electronic Design Automation - MacMillen, Butts.. (2000) (Correct)
No context found.
J. P. Blanks, "Near-optimal placement using a quadratic objective function, " in Proc. IEEE Design Automation Conf., 1985, pp. 609--615.
Spectral Partitioning: The More Eigenvectors, The Better - Alpert, Yao (1994) (19 citations) (Correct)
No context found.
J. P. Blanks, "Near-Optimal Placement Using a Quadratic Objective Function," Proc. ACM/IEEE Design Automation Conf., 1985, pp. 609-615.
New Iterative Linear Solvers For Parallel Circuit Simulation - Suda (1996) (2 citations) (Correct)
No context found.
J. P. Blanks, "Near-Optimal Placement using a Quadratic Objective Function," Proc. 22nd DAC, 1985, pp. 609--615.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC