Sciweavers

CORR
2012
Springer
174views Education» more  CORR 2012»
12 years 8 months ago
Partial Searchlight Scheduling is Strongly PSPACE-complete
The problem of searching a polygonal region for an unpredictably moving intruder by a set of stationary guards, each carrying an orientable laser, is known as the Searchlight Sche...
Giovanni Viglietta
JPDC
2008
161views more  JPDC 2008»
14 years 12 days ago
Base station placement on boundary of a convex polygon
Let P be a polygonal region which is forbidden for placing a base station in the context of mobile communication. Our objective is to place one base station at any point on the bo...
Sasanka Roy, Debabrata Bardhan, Sandip Das