Sciweavers

13987 search results - page 8 / 2798
» The Two Guards Problem
Sort
View
IPPS
2005
IEEE
14 years 1 months ago
GUARD: Gossip Used for Autonomous Resource Detection
A growing trend in the development and deployment of grid computing systems is decentralization. Decentralizing these systems helps make them more scalable and robust, but poses s...
Sagnik Nandy, Larry Carter, Jeanne Ferrante
SODA
2004
ACM
82views Algorithms» more  SODA 2004»
13 years 9 months ago
On finding a guard that sees most and a shop that sells most
We present a near-quadratic time algorithm that computes a point inside a simple polygon P having approximately the largest visibility polygon inside P, and a nearlinear time algo...
Otfried Cheong, Alon Efrat, Sariel Har-Peled
IPL
2006
116views more  IPL 2006»
13 years 7 months ago
Guarding galleries and terrains
Let P be a polygon with n vertices. We say that two points of P see each other if the line segment connecting them lies inside (the closure of) P. In this paper we present efficie...
Alon Efrat, Sariel Har-Peled
AMW
2010
13 years 9 months ago
Query Rewriting under Non-Guarded Rules
We address the problem of answering conjunctive queries over knowledge bases, specified by sets of first-order sentences called tuple-generating dependencies (TGDs). This problem i...
Andrea Calì, Georg Gottlob, Andreas Pieris
DDECS
2009
IEEE
106views Hardware» more  DDECS 2009»
14 years 2 months ago
Forward and backward guarding in early output logic
—Quasi Delay Insensitive asynchronous logic is a very robust system allowing safe implementations while requiring minimal timing assumptions. Unfortunately the design methodologi...
Charlie Brej, Doug Edwards