Sciweavers

3637 search results - page 636 / 728
» On Dynamic Bit-Probe Complexity
Sort
View
SIGMETRICS
2003
ACM
129views Hardware» more  SIGMETRICS 2003»
14 years 3 months ago
Run-time modeling and estimation of operating system power consumption
The increasing constraints on power consumption in many computing systems point to the need for power modeling and estimation for all components of a system. The Operating System ...
Tao Li, Lizy Kurian John
EAGC
2003
Springer
14 years 3 months ago
Automatic Services Discovery, Monitoring and Visualization of Grid Environments: The MapCenter Approach
The complexity of Grid environments is growing as more projects and applications appear in this quick-evolving domain. Widespread applications are distributed over thousands of com...
Franck Bonnassieux, Robert Harakaly, Pascale Prime...
ICMI
2003
Springer
131views Biometrics» more  ICMI 2003»
14 years 3 months ago
TorqueBAR: an ungrounded haptic feedback device
Kinesthetic feedback is a key mechanism by which people perceive object properties during their daily tasks – particularly inertial properties. For example, transporting a glass...
Colin Swindells, Alex Unden, Tao Sang
PLDI
2010
ACM
14 years 3 months ago
Adversarial memory for detecting destructive races
Multithreaded programs are notoriously prone to race conditions, a problem exacerbated by the widespread adoption of multi-core processors with complex memory models and cache coh...
Cormac Flanagan, Stephen N. Freund
STOC
2010
ACM
295views Algorithms» more  STOC 2010»
14 years 3 months ago
Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
MohammadHossein Bateni, MohammadTaghi Hajiaghayi a...