Sciweavers

908 search results - page 67 / 182
» Temporal Analysis of Time Bounded Digital Systems
Sort
View
PODC
2009
ACM
15 years 10 months ago
Tight bounds for clock synchronization
d Abstract] Christoph Lenzen Computer Engineering and Networks Laboratory (TIK) ETH Zurich, 8092 Zurich, Switzerland lenzen@tik.ee.ethz.ch Thomas Locher Computer Engineering and N...
Christoph Lenzen, Thomas Locher, Roger Wattenhofer
STOC
2012
ACM
196views Algorithms» more  STOC 2012»
13 years 8 days ago
Time-space tradeoffs in resolution: superpolynomial lower bounds for superlinear space
We give the first time-space tradeoff lower bounds for Resolution proofs that apply to superlinear space. In particular, we show that there are formulas of size N that have Reso...
Paul Beame, Christopher Beck, Russell Impagliazzo
HICSS
2003
IEEE
114views Biometrics» more  HICSS 2003»
15 years 3 months ago
Duration in the Digital Economy
We examine the drivers of Internet firm survival using a multi-method survival analysis. Based on previous literature on business failure and recent IS research on e-commerce busi...
Robert J. Kauffman, Bin Wang
IPPS
2009
IEEE
15 years 4 months ago
Multi-users scheduling in parallel systems
We are interested in this paper to study scheduling problems in systems where many users compete to perform their respective jobs on shared parallel resources. Each user has speci...
Erik Saule, Denis Trystram
RTSS
2003
IEEE
15 years 3 months ago
Data Caches in Multitasking Hard Real-Time Systems
Data caches are essential in modern processors, bridging the widening gap between main memory and processor speeds. However, they yield very complex performance models, which make...
Xavier Vera, Björn Lisper, Jingling Xue