Sciweavers

599 search results - page 74 / 120
» The repeater tree construction problem
Sort
View
HEURISTICS
2008
92views more  HEURISTICS 2008»
14 years 9 months ago
Learning heuristics for basic block instruction scheduling
Instruction scheduling is an important step for improving the performance of object code produced by a compiler. A fundamental problem that arises in instruction scheduling is to ...
Abid M. Malik, Tyrel Russell, Michael Chase, Peter...
DAC
2011
ACM
13 years 9 months ago
Fault-tolerant 3D clock network
Clock tree synthesis is one of the most important and challenging problems in 3D ICs. The clock signals have to be delivered by through-silicon vias (TSVs) to different tiers with...
Chiao-Ling Lung, Yu-Shih Su, Shih-Hsiu Huang, Yiyu...
ESORICS
2006
Springer
15 years 1 months ago
Secure Key-Updating for Lazy Revocation
Abstract. We consider the problem of efficient key management and user revocation in cryptographic file systems that allow shared access to files. A performanceefficient solution t...
Michael Backes, Christian Cachin, Alina Oprea
STOC
2004
ACM
177views Algorithms» more  STOC 2004»
15 years 10 months ago
Lower bounds for linear degeneracy testing
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...
Nir Ailon, Bernard Chazelle
ICC
2007
IEEE
174views Communications» more  ICC 2007»
15 years 4 months ago
Fairness Improvement and Efficient Rerouting in Mobile Ad Hoc Networks
— Mobile ad hoc networking allows nodes to form temporary networks and communicate with each other possibly via multiple hops. By using a special node called the gateway, an ad h...
Norihiro Ohata, Yongbing Zhang, Yusheng Ji, Xuemin...