Sciweavers

13987 search results - page 538 / 2798
» The Two Guards Problem
Sort
View
INFOCOM
2009
IEEE
16 years 1 months ago
Approximation Algorithms for Data Broadcast in Wireless Networks
—Broadcasting is a fundamental operation in wireless networks and plays an important role in the communication protocol design. In multihop wireless networks, however, interferen...
Rajiv Gandhi, Yoo-Ah Kim, Seungjoon Lee, Jiho Ryu,...
IWPEC
2009
Springer
16 years 1 months ago
Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms
We study the parameterized complexity of two families of problems: the bounded length disjoint paths problem and the bounded length cut problem. From Menger’s theorem both proble...
Petr A. Golovach, Dimitrios M. Thilikos
GLOBECOM
2008
IEEE
16 years 1 months ago
Exploiting Partial Cooperation for Source and Channel Coding in Sensor Networks
Abstract—A network with two sensors communicating a remote measurement to a common access point (AP) is investigated. The sensors are connected via out-of-band and finite-capaci...
Osvaldo Simeone
INFOCOM
2008
IEEE
16 years 1 months ago
Constrained Relay Node Placement in Wireless Sensor Networks to Meet Connectivity and Survivability Requirements
— 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...
Satyajayant Misra, Seung Don Hong, Guoliang Xue, J...
ICRA
2007
IEEE
137views Robotics» more  ICRA 2007»
16 years 1 months ago
Decidability of Motion Planning with Differential Constraints
— Classical path planning does not address many of the challenges of robotic systems subject to differential constraints. While there have been many recent efforts to develop mot...
Peng Cheng, George J. Pappas, Vijay Kumar