Sciweavers

1740 search results - page 321 / 348
» Minimal structures for stories
Sort
View
PPOPP
2006
ACM
14 years 3 months ago
Exploiting distributed version concurrency in a transactional memory cluster
We investigate a transactional memory runtime system providing scaling and strong consistency for generic C++ and SQL applications on commodity clusters. We introduce a novel page...
Kaloian Manassiev, Madalin Mihailescu, Cristiana A...
FOCS
2005
IEEE
14 years 3 months ago
How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems
Robust optimization has traditionally focused on uncertainty in data and costs in optimization problems to formulate models whose solutions will be optimal in the worstcase among ...
Kedar Dhamdhere, Vineet Goyal, R. Ravi, Mohit Sing...
ICRA
2005
IEEE
130views Robotics» more  ICRA 2005»
14 years 3 months ago
Effective Constrained Dynamic Simulation Using Implicit Constraint Enforcement
- Stable and effective enforcement of hard constraints is one of the crucial components in controlling physics-based dynamic simulation systems. The conventional explicit Baumgarte...
Min Hong, Min-Hyung Choi, Sunhwa Jung, Samuel W. J...
INFOCOM
2005
IEEE
14 years 3 months ago
Gossip algorithms: design, analysis and applications
Abstract— Motivated by applications to sensor, peer-topeer and ad hoc networks, we study distributed asynchronous algorithms, also known as gossip algorithms, for computation and...
Stephen P. Boyd, Arpita Ghosh, Balaji Prabhakar, D...
INFOCOM
2005
IEEE
14 years 3 months ago
BARD: Bayesian-assisted resource discovery in sensor networks
Data dissemination in sensor networks requires four components: resource discovery, route establishment, packet forwarding, and route maintenance. Resource discovery can be the mos...
Fred Stann, John S. Heidemann