Sciweavers

1033 search results - page 196 / 207
» Stop the numbers game
Sort
View
STOC
2004
ACM
158views Algorithms» more  STOC 2004»
15 years 10 months ago
Collective asynchronous reading with polylogarithmic worst-case overhead
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander ...
SODA
2010
ACM
190views Algorithms» more  SODA 2010»
15 years 7 months ago
One-Counter Markov Decision Processes
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...
Tomas Brazdil, Vaclav Brozek, Kousha Etessami, Ant...
SOSP
2005
ACM
15 years 6 months ago
BAR fault tolerance for cooperative services
This paper describes a general approach to constructing cooperative services that span multiple administrative domains. In such environments, protocols must tolerate both Byzantin...
Amitanand S. Aiyer, Lorenzo Alvisi, Allen Clement,...
SEMCO
2009
IEEE
15 years 4 months ago
LAIR: A Language for Automated Semantics-Aware Text Sanitization Based on Frame Semantics
—We present LAIR: A domain-specific language that enables users to specify actions to be taken upon meeting specific semantic frames in a text, in particular to rephrase and re...
Steffen Hedegaard, Søren Houen, Jakob Grue ...
SSDBM
2009
IEEE
119views Database» more  SSDBM 2009»
15 years 4 months ago
Identifying the Most Endangered Objects from Spatial Datasets
Abstract. Real-life spatial objects are usually described by their geographic locations (e.g., longitude and latitude), and multiple quality attributes. Conventionally, spatial dat...
Hua Lu, Man Lung Yiu