Because of the increasing dominance of interconnect issues in advanced IC technology, placement has become a critical step in the IC design flow. To get accurate interconnect inf...
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
Abstract--This paper presents a solution to the problem of performance-driven buffered routing tree generation for VLSI circuits. Using a novel bottom-up construction algorithm and...
Scheduling of a construction project requires: a) hierarchical decomposition of the project; b) incorporation of risk and uncertainty in the activity time and cost estimates; and ...
Time dependant models have been intensively studied for many reasons, among others because of their applications in software verification and due to the development of embedded pla...