VLSI/PCB placement with obstacles based on sequence-pair

No abstract is available for this paper.

• Publication year

  1997

• Venue

  ACM International Symposium on Physical Design

• Publication date

  1997-04-01

• Fields of study

  Computer Science, Engineering

• Identifiers
  DOI 10.1145/267665.267675
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Module placement on BSG-structure and IC layout applications

  1996cited by this paper
• VLSI module placement based on rectangle-packing by the sequence-pair

  1996cited by this paper
• Rectangle-packing-based module placement

  1995cited by this paper
• Model and solution strategy for placement of rectangular blocks in the Euclidean plane

  1988cited by this paper
• An Automatic Rectilinear Partitioning Procedure for Standard Cells

  1987cited by this paper
• A New Algorithm for Floorplan Design

  1986cited by this paper
• An Analytical Algorithm for Placement of Arbitrarily Sized Rectangular Blocks

  1985cited by this paper

• Constraint Graph-based PCB Legalization Considering Dense, Heterogeneous, Irregular-Shaped, and Any-oriented Components

  2025cites this paper
• Cypress: VLSI-Inspired PCB Placement with GPU Acceleration

  2025cites this paper
• Placement in Integrated Circuits using Cyclic Reinforcement Learning and Simulated Annealing

  2020cites this paper
• Modified SA algorithm for wirelength minimization in VLSI circuits

  2015cites this paper
• Error Recovery in Cyberphysical Digital Microfluidic Biochips

  2013cites this paper
• A multiobjective optimization tool for Very Large Scale Integrated nonslicing floorplanning

  2013cites this paper
• A cyberphysical synthesis approach for error recovery in digital microfluidic biochips

  2012cites this paper
• Multi-objective Optimization in VLSI Floorplanning

  2011cites this paper
• Customized simulated annealing based decision algorithms for combinatorial optimization in VLSI floorplanning problem

  2011cites this paper
• Integrated microarchitectural floorplanning and run-time controller for inductive noise mitigation

  2011cites this paper
• New perspectives in VLSI design automation: deterministic packing by Sequence Pair

  2010cites this paper
• Physical design for performance and thermal and power-supply reliability in modern 2D and 3D microarchitectures

  2010influential citation
• UFO: Unified convex optimization algorithms for fixed-outline floorplanning

  2010cites this paper
• Floorplanning for 2.5-D Integration

  2010cites this paper
• Novel Convex Optimization Approaches for VLSI Floorplanning

  2008cites this paper
• Mathematical methods for physical layout of printed circuit boards: an overview

  2008cites this paper
• An improved particle swarm optimizer for placement constraints

  2008cites this paper
• Berth Allocation Planning Optimization in Container Terminals

  2008cites this paper
• Packing-driven sliceable transformation for 3D floorplan designs

  2008cites this paper
• Noise-Direct: A Technique for Power Supply Noise Aware Floorplanning Using Microarchitecture Profiling

  2007cites this paper
• Substrate-aware placement and routing

  2007cites this paper
• A sequence-pair representation and MIP-model-based heuristic for the facility layout problem with rectangular departments

  2007cites this paper
• Berth management in container terminal: the template design problem

  2006cites this paper
• Placement Constraints and Macrocell Overlap Removal Using Particle Swarm Optimization

  2006cites this paper
• Physical design automation for system-on-packages and 3d-integrated circuits

  2006cites this paper
• Algorithm Based on Quasi-human Strategy for Placement Problem with Pre-placed Modules

  2006cites this paper
• Office Layout Support System using Interactive Genetic Algorithm

  2006cites this paper
• On Improved Least Flexibility First Heuristics Superior for Packing and Stock Cutting Problems

  2005influential citation
• An Efficient MOVE Operation for Selected Sequence-Pair Kunihiro Fujiyoshi

  2005cites this paper
• Sliceable transformation of nonslicing floorplans based on vacant block insertion in LB-packing process

  2005cites this paper
• Multi-bend bus driven floorplanning

  2005cites this paper
• Fixed-outline floorplanning with constraints through instance augmentation

  2005cites this paper
• Placement constraints in floorplan design

  2004cites this paper
• A Sequence-Pair and Mixed Integer Programming Based Methodology for the Facility Layout Problem

  2004cites this paper
• A unified framework for generating all propagation functions for logic errors and events

  2004cites this paper
• A hybrid current/voltage mode on-chip signaling scheme with adaptive bandwidth capability

  2004cites this paper
• Corner block list representation and its application with boundary constraints

  2004cites this paper
• An orthogonal simulated annealing algorithm for large floorplanning problems

  2004cites this paper
• TCG-S: orthogonal coupling of P*-admissible representations for general floorplans

  2004cites this paper
• Slicing floorplan with clustering constraint

  2003cites this paper
• A Block Placement Algorithm with Predefined Coordinate Alignment Constraint Based on Sequence Pair Representation

  2003cites this paper
• Berth Allocation Planning Optimization in Container Terminal

  2003cites this paper
• VLSI module placement with pre-placed modules and considering congestion using solution space smoothing

  2003cites this paper
• Selected sequence-pair: an efficient decodable packing representation in linear time using sequence-pair

  2003cites this paper
• Module placement with pre-placed modules using the corner block list representation

  2002cites this paper
• Explicit expression and simultaneous optimization of placement and routing for analog IC layouts

  2002cites this paper
• A unified method to handle different kinds of placement constraints in floorplan design

  2002cites this paper
• An effective quasi-human based heuristic for solving the rectangle packing problem

  2002influential citation
• An efficient decoding method of sequence-pair

  2002cites this paper
• Consistent floorplanning with hierarchical superconstraints

  2002cites this paper
• Incremental mixed-signal layout generation concepts : theory and implementation

  2002cites this paper
• Fundamental algorithms for physical design planning of VLSI

  2002cites this paper
• TCG-S: orthogonal coupling of P/sup */-admissible representations for general floorplans

  2002cites this paper
• Module placement with boundary constraints using the sequence-pair representation

  2001cites this paper
• FAST-SP: a fast algorithm for block placement based on sequence pair

  2001cites this paper
• Slicing floorplan with clustering constraints

  2001cites this paper
• A constructive procedure for optimizing the placement of macrocells

  2001cites this paper
• Fast evaluation of sequence pair in block placement by longest common subsequence computation

  2001cites this paper
• Orthogonal Coupling of P-admissible Representations for Non-slicing Floorplans Track 1 . 1 : Placement and Floorplanning Techniques

  2001cites this paper
• Module placement with pre-placed modules using the B*-tree representation

  2001cites this paper
• Consistent floorplanning with super hierarchical constraints

  2001cites this paper
• Slicing tree is a complete floorplan representation

  2001cites this paper
• A new faster sequence pair algorithm

  2000cites this paper
• AN ADAPTIVE GENETIC ALGORITHM FOR VLSI FLOORPLANNING BASED ON SEQUENCE-PAIR Shingo NAKAYA Tetsushi KOIDEZ Shin 'ichi WAKABAYASHJ

  2000cites this paper
• Dynamic weighting Monte Carlo for constrained floorplan designs in mixed signal application

  2000cites this paper
• B*-trees: a new representation for non-slicing floorplans

  2000cites this paper
• An adaptive genetic algorithm for VLSI floorplanning based on sequence-pair

  2000cites this paper
• Rectilinear block placement using B*-trees

  2000influential citation
• A More Efficient Sequence Pair Perturbation Scheme

  1999cites this paper
• Solving the rectangular packing problem by an adaptive GA based on sequence-pair

  1999cites this paper
• Slicing floorplans with range constraint

  1999cites this paper
• Slicing floorplans with pre-placed modules

  1998cites this paper
• Sequence-pair based placement method for hard/soft/pre-placed modules

  1998influential citation
• Module packing based on the BSG-structure and IC layout applications

  1998cites this paper
• Hybrid floorplanning based on partial clustering and module restructuring

  1996cites this paper