409 search results - page 66 / 82 » Polynomial Time Approximation Schemes and Parameterized Comp... |
COMPGEOM
2008
ACM
14 years 11 months ago
2008
ACM
We consider the problem of finding a maximum number of disjoint paths for unit disks moving amidst static or dynamic obstacles. For the static case we give efficient exact algorit...
INFOCOM
2008
IEEE
15 years 4 months ago
2008
IEEE
— The relay node placement problem for wireless sensor networks is concerned with placing a minimum number of relay nodes into a wireless sensor network to meet certain connectiv...
INFOCOM
2007
IEEE
15 years 4 months ago
2007
IEEE
— Two fundamental functions of the sensor nodes in a wireless sensor network are to sense its environment and to transmit sensed information to a basestation. One approach to pro...
JSAC
2006
14 years 9 months ago
2006
We focus on detecting intrusions in ad hoc networks using the misuse detection technique. We allow for detection modules that periodically stop functioning due to operational failu...
JCO
2006
14 years 9 months ago
2006
We study a combinatorial problem motivated by a receiver-oriented model of TCP traffic from [7], that incorporates information on both arrival times, and the dynamics of packet IDs...