Given a set of disjoint groups of points in the plane, the rectilinear group Steiner tree problem is the problem of nding a shortest intercon-nection (under the rectilinear metric) which includes at least one point from each group. This is an important generalization of the well-known rectilinear Steiner tree problem which has direct applications in VLSI design, i.e., it is the fundamental prob...

Low power VLSI testing is indispensible in switching components and number of hardware/software-based techniques has been still developed to minimize the dynamic power dissipation. In earlier days, primary concerns of VLSI design were focused in area, performance, cost and reliability. But in current years, the design constraints have begun to change because of increasing low power testing. XOR...

In analytical placement, one seeks locations of circuit modules that optimize an objective function, but allows module overlaps. Our work introduces a novel minimization of maximal path delay that improves upon previously known algorithms for timing-driven placement. Our placement algorithms have provable properties and are fast in practice.

Model programs and standards for substance abuse prevention have been identified by a number of federal agencies. The study reported here assessed two methods of delivery of one such program, Life Skills Training (LST), implemented in nine rural disadvantaged school districts. The results indicate that neither standard LST nor an infused LST delivery method was found effective for the entire sa...

We present a fast algorithm to compute an optimal rec-tilinear Steiner tree for extremal point sets. A point set is extremal if each point lies on the boundary of a rectilinear convex hull of the point set. Our algorithm can be used in homotopic routing in VLSI layout design and it runs in O(k 2 n) time, where n is the size of the point set and k is the size of its rectilinear convex hull.

This paper presents a new model for VLSI routing in the presence of obstacles, that transforms any routing instance from a geometric problem into a graph problem. It is the first model that allows computation of optimal obstacle-avoiding rectilinear Steiner trees in time corresponding to the instance size (the number of terminals and obstacle border segments) rather than the size of the routing...

| We describe a connectionist architecture which shows promise in obtaining the global optimal solution to the classical minimum spanning tree problem in a time independent of the problem size. Using commonly available analogue electronic components, a network prototype was found to give the global optimal solution within the microseconds range. Simulation results and limiting factors of the pe...

We discuss what constitutes an integrated system in AI, and why AI researchers should be interested in building and studying them. Taking integrated systems to be ones that integrate a variety of components in order to perform some task from start to finish, we believe that such systems (a) allow us to better ground our theoretical work in actual tasks, and (b) provide an opportunity for much-n...

The performance description language PDL provides a compact notation for the speciication of non-functional attributes of VLSI systems. This paper presents evaluation mechanisms which allow the designer to assert performance goals on PDL models of VLSI systems and determine if the constrained models are satissable. This is done by developing a PDL performance model and constructing a constraint...

VoD, S., Steiner’s problem in graphs: heuristic methods, Discrete Applied Mathematics 40 (1992) 45-72. Real world problems arising in the layout of connection structures in networks as e.g. in VLSI design may often be decomposed into a number of well-known combinatorial optimization problems. Steiner’s problem in graphs is included within this context. According to its complexity one is interes...