Sciweavers

77 search results - page 1 / 16
» Keeping Bits Safe: How Hard Can It Be
Sort
View
QUEUE
2010
57views more  QUEUE 2010»
13 years 6 months ago
Keeping Bits Safe: How Hard Can It Be?
David S. H. Rosenthal
SIGCOMM
2010
ACM
13 years 7 months ago
How internet concepts and technologies can help green and smarten the electrical grid
Several powerful forces are gathering to make fundamental and irrevocable changes to the century-old grid. The nextgeneration grid, often called the `smart grid,' will featur...
Srinivasan Keshav, Catherine Rosenberg
TEC
2012
195views Formal Methods» more  TEC 2012»
11 years 10 months ago
The Effects of Constant and Bit-Wise Neutrality on Problem Hardness, Fitness Distance Correlation and Phenotypic Mutation Rates
Kimura’s neutral theory of evolution has inspired researchers from the evolutionary computation community to incorporate neutrality into Evolutionary Algorithms (EAs) in the hop...
Riccardo Poli, Edgar Galván López
RTSS
2006
IEEE
14 years 1 months ago
Delay Analysis in Temperature-Constrained Hard Real-Time Systems with General Task Arrivals
In this paper, we study temperature-constrained hard realtime systems, where real-time guarantees must be met without exceeding safe temperature levels within the processor. Dynam...
Shengquan Wang, Riccardo Bettati
CCS
2009
ACM
14 years 2 months ago
Keep your friends close: the necessity for updating an anomaly sensor with legitimate environment changes
Large-scale distributed systems have dense, complex code-bases that are assumed to perform multiple and inter-dependent tasks while user interaction is present. The way users inte...
Angelos Stavrou, Gabriela F. Cretu-Ciocarlie, Mich...