Sciweavers

9841 search results - page 750 / 1969
» Distributed Value Functions
Sort
View
PODC
1993
ACM
15 years 11 months ago
A Lower Bound on Wait-Free Counting
A counting protocol (mod m) consists of shared memory bits - referred to as the counter - and of a procedure for incrementing the counter value by 1 (mod m). The procedure may be ...
Shlomo Moran, Gadi Taubenfeld
PODC
1990
ACM
15 years 11 months ago
Composite Registers
We introduce a shared data object, called a composite register, that generalizes the notion of an atomic register. A composite register is an array-like shared data object that is...
James H. Anderson
EDBT
2009
ACM
117views Database» more  EDBT 2009»
15 years 10 months ago
Parsimonious temporal aggregation
Temporal aggregation is a crucial operator in temporal databases and has been studied in various flavors. In instant temporal aggregation (ITA) the aggregate value at time instan...
Juozas Gordevicius, Johann Gamper, Michael H. B&ou...
ACMDIS
2008
ACM
15 years 9 months ago
Cognitive partnerships on the bench top: designing to support scientific researchers
There has been a growing interest to develop technologies for laboratory environments. However, existing systems are underdeployed in real research labs. In order to create more s...
Ellie Harmon, Nancy J. Nersessian
BIOCOMP
2008
15 years 9 months ago
On the Role of a Nonlinear Stress-Strain Relation in Brain Trauma
We investigate how a nonlinear stress-strain relation (that leads to a stiffening of the brain matter under strain) influences the brain dynamics in traumatic situations. We numeri...
Igor Szczyrba, Martin Burtscher, Rafal Szczyrba