Sciweavers

995 search results - page 194 / 199
» Minimizing Congestion in General Networks
Sort
View
SOSP
2007
ACM
15 years 8 months ago
Attested append-only memory: making adversaries stick to their word
Researchers have made great strides in improving the fault tolerance of both centralized and replicated systems against arbitrary (Byzantine) faults. However, there are hard limit...
Byung-Gon Chun, Petros Maniatis, Scott Shenker, Jo...
93
Voted
CORR
2008
Springer
174views Education» more  CORR 2008»
14 years 11 months ago
Bounded Budget Connection (BBC) Games or How to make friends and influence people, on a budget
Motivated by applications in social networks, peer-to-peer and overlay networks, we define and study the Bounded Budget Connection (BBC) game - we have a collection of n players o...
Nikolaos Laoutaris, Laura J. Poplawski, Rajmohan R...
DAC
2008
ACM
16 years 19 days ago
Type-matching clock tree for zero skew clock gating
Clock skew minimization is always very important in the clock tree synthesis. Due to clock gating, the clock tree may include different types of logic gates, e.g., AND gates, OR g...
Chia-Ming Chang, Shih-Hsu Huang, Yuan-Kai Ho, Jia-...
117
Voted
DAC
2003
ACM
16 years 18 days ago
A survey of techniques for energy efficient on-chip communication
Interconnects have been shown to be a dominant source of energy consumption in modern day System-on-Chip (SoC) designs. With a large (and growing) number of electronic systems bei...
Vijay Raghunathan, Mani B. Srivastava, Rajesh K. G...
86
Voted
EDBT
2008
ACM
150views Database» more  EDBT 2008»
15 years 11 months ago
Finding time-dependent shortest paths over large graphs
The spatial and temporal databases have been studied widely and intensively over years. In this paper, we study how to answer queries of finding the best departure time that minim...
Bolin Ding, Jeffrey Xu Yu, Lu Qin