Sciweavers

6582 search results - page 1148 / 1317
» The focus of attention problem
Sort
View
PODC
2011
ACM
14 years 9 months ago
Locally checkable proofs
This work studies decision problems from the perspective of nondeterministic distributed algorithms. For a yes-instance there must exist a proof that can be verified with a distri...
Mika Göös, Jukka Suomela
ICDCS
2011
IEEE
14 years 6 months ago
Intelligent Placement of Datacenters for Internet Services
—Popular Internet services are hosted by multiple geographically distributed datacenters. The location of the datacenters has a direct impact on the services’ response times, c...
Iñigo Goiri, Kien Le, Jordi Guitart, Jordi ...
PODC
2012
ACM
13 years 9 months ago
The cost of fault tolerance in multi-party communication complexity
Multi-party communication complexity involves distributed computation of a function over inputs held by multiple distributed players. A key focus of distributed computing research...
Binbin Chen, Haifeng Yu, Yuda Zhao, Phillip B. Gib...
ICDT
2012
ACM
251views Database» more  ICDT 2012»
13 years 9 months ago
Computing universal models under guarded TGDs
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
André Hernich
SMA
2008
ACM
172views Solid Modeling» more  SMA 2008»
15 years 6 months ago
Guarding curvilinear art galleries with edge or mobile guards
In this paper we consider the problem of monitoring an art gallery modeled as a polygon, the edges of which are arcs of curves. We consider two types of guards: edge guards (these...
Menelaos I. Karavelas
« Prev « First page 1148 / 1317 Last » Next »