Sciweavers

73 search results - page 3 / 15
» Steiner network construction for timing critical nets
Sort
View
ICCAD
2006
IEEE
119views Hardware» more  ICCAD 2006»
14 years 1 months ago
FastRoute: a step to integrate global routing into placement
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...
Min Pan, Chris C. N. Chu
STOC
2003
ACM
133views Algorithms» more  STOC 2003»
14 years 5 months ago
A fast algorithm for computing steiner edge connectivity
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 ...
Richard Cole, Ramesh Hariharan
TCAD
2002
93views more  TCAD 2002»
13 years 4 months ago
Hierarchical buffered routing tree generation
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...
Amir H. Salek, Jinan Lou, Massoud Pedram
WSC
1997
13 years 6 months ago
Petri Net Based Simulation of Construction Schedules
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 ...
Anil Sawhney
FORMATS
2008
Springer
13 years 6 months ago
Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets
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...
Jirí Srba