4894 search results - page 3 / 979 » The Guarding Problem - Complexity and Approximation |
JCM
2006
13 years 5 months ago
2006
Orthogonal Frequency Division Multiplexing (OFDM) has been increasingly used in wireless broadband communication systems. Guard interval (GI) is used in OFDM system to reduce inter...
STACS
2009
Springer
14 years 16 days ago
2009
Springer
SODA
2004
ACM
13 years 7 months ago
2004
ACM
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...
COMPGEOM
1991
ACM
13 years 9 months ago
1991
ACM
Given a simple polygon in the plane with two distinguished vertices, s and g, is it possible for two guards to simultaneously walk along the two boundary chains from s to g in suc...
CDC
2009
IEEE
13 years 10 months ago
2009
IEEE
Abstract— We introduce a problem in which a service vehicle seeks to defend a deadline (boundary) from dynamically arriving mobile targets. The environment is a rectangle and the...