Sciweavers

13987 search results - page 9 / 2798
» The Two Guards Problem
Sort
View
LICS
2010
IEEE
13 years 6 months ago
Highly Acyclic Groups, Hypergraph Covers and the Guarded Fragment
We construct finite groups whose Cayley graphs have large girth even w.r.t. a discounted distance measure that contracts arbitrarily long sequences of edges from the same colour ...
Martin Otto
IJCGA
2010
99views more  IJCGA 2010»
13 years 6 months ago
Finding All Door Locations that Make a Room Searchable
—A room is a simple polygon with a prespecified point, called the door, on its boundary. Search may be conducted by two guards on the boundary who keep mutual visibility at all ...
Tsunehiko Kameda, John Z. Zhang
ICDT
2012
ACM
251views Database» more  ICDT 2012»
11 years 10 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
IPL
2010
134views more  IPL 2010»
13 years 2 months ago
Parameterized algorithm for eternal vertex cover
In this paper we initiate the study of a "dynamic" variant of the classical Vertex Cover problem, the Eternal Vertex Cover problem introduced by Klostermeyer and Mynhard...
Fedor V. Fomin, Serge Gaspers, Petr A. Golovach, D...
CN
2004
109views more  CN 2004»
13 years 7 months ago
QoS-aware radio resource management scheme for CDMA cellular networks based on dynamic interference guard margin (IGM)
Efficient radio resource management (RRM) for CDMA-based cellular communication systems using the interference guard margin (IGM) scheme is investigated in this work. Two importan...
Huan Chen, Sunil Kumar, C. C. Jay Kuo