416 search results - page 79 / 84 » Approximation Algorithms for Reliable Stochastic Combinatori... |
171
click to vote
INFOCOM
2010
IEEE
15 years 1 months ago
2010
IEEE
Abstract—Wireless sensor networks (WSNs) are typically composed of low-cost sensors that are deeply integrated with physical environments. As a result, the sensing performance of...
124
Voted
CORR
2012
Springer
13 years 11 months ago
2012
Springer
In this paper we consider the MAX-WEIGHT protocol for routing and scheduling in wireless networks under an adversarial model. This protocol has received a significant amount of a...
149
click to vote
TAMC
2009
Springer
15 years 7 months ago
2009
Springer
Given a universal constant k, the multiple Stack Travelling Salesman Problem (kSTSP in short) consists in finding a pickup tour T1 and a delivery tour T2 of n items on two distinc...
147
click to vote
CGF
2006
15 years 3 months ago
2006
We propose a new technique for quad-dominant remeshing which separates the local regularity requirements from the global alignment requirements by working in two steps. In the fir...
115
click to vote
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
—Coverage is a fundamental problem in Wireless Sensor Networks (WSNs). Existing studies on this topic focus on 2D ideal plane coverage and 3D full space coverage. In many real wo...