Sciweavers

6105 search results - page 842 / 1221
» A Parallel Algorithm for Bound-Smoothing
Sort
View
163
Voted
SPAA
2010
ACM
15 years 11 months ago
Lightweight, robust adaptivity for software transactional memory
When a program uses Software Transactional Memory (STM) to synchronize accesses to shared memory, the performance often depends on which STM implementation is used. Implementation...
Michael F. Spear
DCOSS
2010
Springer
15 years 11 months ago
ZeroCal: Automatic MAC Protocol Calibration
Sensor network MAC protocols are typically configured for an intended deployment scenario once and for all at compile time. This approach, however, leads to suboptimal performance...
Andreas Meier, Matthias Woehrle, Marco Zimmerling,...
CONCUR
2001
Springer
15 years 11 months ago
Symbolic Computation of Maximal Probabilistic Reachability
We study the maximal reachability probability problem for infinite-state systems featuring both nondeterministic and probabilistic choice. The problem involves the computation of ...
Marta Z. Kwiatkowska, Gethin Norman, Jeremy Sprost...
212
Voted
IWVF
2001
Springer
15 years 11 months ago
Judging Whether Multiple Silhouettes Can Come from the Same Object
We consider the problem of recognizing an object from its silhouette. We focus on the case in which the camera translates, and rotates about a known axis parallel to the image, suc...
David W. Jacobs, Peter N. Belhumeur, Ian Jermyn
IPPS
2000
IEEE
15 years 11 months ago
Quality of Service Negotiation for Distributed, Dynamic Real-Time Systems
Dynamic, distributed, real-time systems control an environment that varies widely without any time-invariant statistical or deterministic characteristic, are spread across multiple...
Charles Cavanaugh, Lonnie R. Welch, Behrooz Shiraz...