Sciweavers

3838 search results - page 48 / 768
» Techniques for Optimization of Net Algorithms
Sort
View
ICALP
2000
Springer
15 years 1 months ago
Efficient Verification Algorithms for One-Counter Processes
We study the problem of strong/weak bisimilarity between processes of one-counter automata and finite-state processes. We show that the problem of weak bisimilarity between process...
Antonín Kucera
MODELS
2009
Springer
15 years 4 months ago
An Incremental Algorithm for High-Performance Runtime Model Consistency
We present a novel technique for applying two-level runtime models to distributed systems. Our approach uses graph rewriting rules to transform a high-level source model into one o...
Christopher Wolfe, T. C. Nicholas Graham, W. Greg ...
DAC
2009
ACM
15 years 10 months ago
A fully polynomial time approximation scheme for timing driven minimum cost buffer insertion
As VLSI technology enters the nanoscale regime, interconnect delay has become the bottleneck of the circuit timing. As one of the most powerful techniques for interconnect optimiz...
Shiyan Hu, Zhuo Li, Charles J. Alpert
ATAL
2008
Springer
14 years 11 months ago
A tractable and expressive class of marginal contribution nets and its applications
Coalitional games raise a number of important questions from the point of view of computer science, key among them being how to represent such games compactly, and how to efficien...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...
ISVLSI
2007
IEEE
161views VLSI» more  ISVLSI 2007»
15 years 4 months ago
CMP-aware Maze Routing Algorithm for Yield Enhancement
— Chemical-Mechanical Polishing (CMP) is one of the key steps during nanometer VLSI manufacturing process where minimum variation of layout pattern densities is desired. This pap...
Hailong Yao, Yici Cai, Xianlong Hong