Sciweavers

1254 search results - page 235 / 251
» Making Hard Problems Harder
Sort
View
ASPLOS
2010
ACM
14 years 3 months ago
Analyzing multicore dumps to facilitate concurrency bug reproduction
Debugging concurrent programs is difficult. This is primarily because the inherent non-determinism that arises because of scheduler interleavings makes it hard to easily reproduc...
Dasarath Weeratunge, Xiangyu Zhang, Suresh Jaganna...
SAC
2010
ACM
14 years 3 months ago
Trustworthy interaction balancing in mixed service-oriented systems
Web-based collaboration systems typically require dynamic and context-based interactions between people and services. To support such complex interaction scenarios, we introduce a...
Florian Skopik, Daniel Schall, Schahram Dustdar
ISPD
2009
ACM
141views Hardware» more  ISPD 2009»
14 years 3 months ago
A faster approximation scheme for timing driven minimum cost layer assignment
As VLSI technology moves to the 65nm node and beyond, interconnect delay greatly limits the circuit performance. As a critical component in interconnect synthesis, layer assignmen...
Shiyan Hu, Zhuo Li, Charles J. Alpert
SENSYS
2009
ACM
14 years 3 months ago
Evaluating a BASIC approach to sensor network node programming
Sensor networks have the potential to empower domain experts from a wide range of fields. However, presently they are notoriously difficult for these domain experts to program, ...
J. Scott Miller, Peter A. Dinda, Robert P. Dick
WSDM
2009
ACM
161views Data Mining» more  WSDM 2009»
14 years 3 months ago
Predicting the readability of short web summaries
Readability is a crucial presentation attribute that web summarization algorithms consider while generating a querybaised web summary. Readability quality also forms an important ...
Tapas Kanungo, David Orr