Sciweavers

12673 search results - page 2184 / 2535
» Learning while designing
Sort
View
DAC
1996
ACM
15 years 11 months ago
Optimal Clock Skew Scheduling Tolerant to Process Variations
1- A methodology is presented in this paper for determining an optimal set of clock path delays for designing high performance VLSI/ULSI-based clock distribution networks. This met...
José Luis Neves, Eby G. Friedman
ICALP
1993
Springer
15 years 11 months ago
Exact Asymptotics of Divide-and-Conquer Recurrences
The divide-and-conquer principle is a majoi paradigm of algorithms design. Corresponding cost functions satisfy recurrences that directly reflect the decomposition mechanism used i...
Philippe Flajolet, Mordecai J. Golin
ASPDAC
2007
ACM
77views Hardware» more  ASPDAC 2007»
15 years 10 months ago
Hippocrates: First-Do-No-Harm Detailed Placement
Physical synthesis optimizations and engineering change orders typically change the locations of cells, resize cells or add more cells to the design after global placement. Unfort...
Haoxing Ren, David Z. Pan, Charles J. Alpert, Gi-J...
DEBS
2007
ACM
15 years 10 months ago
SpiderCast: a scalable interest-aware overlay for topic-based pub/sub communication
We introduce SpiderCast, a distributed protocol for constructing scalable churn-resistant overlay topologies for supporting decentralized topic-based pub/sub communication. Spider...
Gregory Chockler, Roie Melamed, Yoav Tock, Roman V...
ICDCS
2010
IEEE
15 years 10 months ago
Existence Theorems and Approximation Algorithms for Generalized Network Security Games
—Aspnes et al [2] introduced an innovative game for modeling the containment of the spread of viruses and worms (security breaches) in a network. In this model, nodes choose to i...
V. S. Anil Kumar, Rajmohan Rajaraman, Zhifeng Sun,...
« Prev « First page 2184 / 2535 Last » Next »