Sciweavers

237 search results - page 41 / 48
» Just enough tabling
Sort
View
IPTPS
2005
Springer
14 years 1 months ago
Evaluating DHT-Based Service Placement for Stream-Based Overlays
Stream-based overlay networks (SBONs) are one approach to implementing large-scale stream processing systems. A fundamental consideration in an SBON is that of service placement, ...
Peter R. Pietzuch, Jeffrey Shneidman, Jonathan Led...
ICRA
1994
IEEE
139views Robotics» more  ICRA 1994»
13 years 11 months ago
Balancing of a Planar Bouncing Object
While most previous work in planning manipulation tasks relies on the assumption of quasi-static conditions, there can be situations where the quasi-static assumption may not hold...
Nina B. Zumel, Michael Erdmann
CMSB
2008
Springer
13 years 9 months ago
Automatic Complexity Analysis and Model Reduction of Nonlinear Biochemical Systems
Kinetic models for biochemical systems often comprise a large amount of coupled differential equations with species concentrations varying on different time scales. In this paper w...
Dirk Lebiedz, Dominik Skanda, Marc Fein
NSDI
2004
13 years 9 months ago
Efficient Routing for Peer-to-Peer Overlays
Most current peer-to-peer lookup schemes keep a small amount of routing state per node, typically logarithmic in the number of overlay nodes. This design assumes that routing info...
Anjali Gupta, Barbara Liskov, Rodrigo Rodrigues
ASPLOS
2011
ACM
12 years 11 months ago
NV-Heaps: making persistent objects fast and safe with next-generation, non-volatile memories
nt, user-defined objects present an attractive abstraction for working with non-volatile program state. However, the slow speed of persistent storage (i.e., disk) has restricted ...
Joel Coburn, Adrian M. Caulfield, Ameen Akel, Laur...