Sciweavers

5675 search results - page 950 / 1135
» Exploiting Chaos for Computation
Sort
View
ICS
2010
Tsinghua U.
15 years 9 months ago
Clustering performance data efficiently at massive scales
Existing supercomputers have hundreds of thousands of processor cores, and future systems may have hundreds of millions. Developers need detailed performance measurements to tune ...
Todd Gamblin, Bronis R. de Supinski, Martin Schulz...
CF
2005
ACM
15 years 9 months ago
Grid result checking
Result checking is the theory and practice of proving that the result of an execution of a program on an input is correct. Result checking has most often been envisioned in the fr...
Cécile Germain-Renaud, Dephine Monnier-Raga...
DAC
2005
ACM
15 years 9 months ago
Hybrid simulation for embedded software energy estimation
Software energy estimation is a critical step in the design of energyefficient embedded systems. Instruction-level simulation techniques, despite several advances, remain too slo...
Anish Muttreja, Anand Raghunathan, Srivaths Ravi, ...
DCOSS
2008
Springer
15 years 9 months ago
Automatic Collection of Fuel Prices from a Network of Mobile Cameras
Abstract. It is an undeniable fact that people want information. Unfortunately, even in today's highly automated society, a lot of the information we desire is still manually ...
Y. F. Dong, Salil S. Kanhere, Chun Tung Chou, Niru...
SODA
2008
ACM
100views Algorithms» more  SODA 2008»
15 years 8 months ago
A tight lower bound for parity in noisy communication networks
We show a tight lower bound of (N log log N) on the number of transmission required to compute the parity of N bits (with constant error) in a network of N randomly placed sensors...
Chinmoy Dutta, Yashodhan Kanoria, D. Manjunath, Ja...