Sciweavers

156 search results - page 18 / 32
» Decomposing Coverings and the Planar Sensor Cover Problem
Sort
View
IJCGA
2000
85views more  IJCGA 2000»
13 years 7 months ago
Obnoxious Facility Location: Complete Service with Minimal Harm
We present e cient algorithms for several instances of the following facility location problem. Facilities and demand sites are represented as points in the plane. Place k obnoxio...
Boaz Ben-Moshe, Matthew J. Katz, Michael Segal
IPPS
2006
IEEE
14 years 1 months ago
Solving generic role assignment exactly
role assignment is a programming abstraction that supports the assignment of user-defined roles to sensor nodes such that certain conditions are met. Many common network configu...
Christian Frank, Kay Römer
ICCAD
2006
IEEE
104views Hardware» more  ICCAD 2006»
14 years 4 months ago
Fullwave volumetric Maxwell solver using conduction modes
We present a gridless method for solving the interior problem for a set of conductors in an homogeneous dielectric, at sufficiently high frequencies, valid for conductor lengths ...
Salvador Ortiz, Roberto Suaya
FOCS
2009
IEEE
14 years 2 months ago
(Meta) Kernelization
Polynomial time preprocessing to reduce instance size is one of the most commonly deployed heuristics to tackle computationally hard problems. In a parameterized problem, every in...
Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshta...
SECON
2010
IEEE
13 years 5 months ago
Two-Tiered Constrained Relay Node Placement in Wireless Sensor Networks: Efficient Approximations
In a wireless sensor network, short range multihop transmissions are preferred to prolong the network lifetime due to super-linear nature of energy consumption with communication d...
Dejun Yang, Satyajayant Misra, Xi Fang, Guoliang X...