7006 search results - page 443 / 1402 » Approximation Algorithms |
154
click to vote
CISS
2008
IEEE
15 years 11 months ago
2008
IEEE
—Large-scale wireless networks must be designed such that there are no gaps in coverage. It is also desirable to minimize the number of access points used in order to minimize th...
141
click to vote
MOBIHOC
2007
ACM
16 years 4 months ago
2007
ACM
In this paper we study the problem of scheduling wireless links in the geometric SINR model, which explicitly uses the fact that nodes are distributed in the Euclidean plane. We p...
140
click to vote
ISCI
2008
15 years 5 months ago
2008
An increase in the performance of deteriorating systems can be achieved through the adoption of suitable maintenance policies. One of the most popular maintenance policies is the ...
155
click to vote
ICDCS
2006
IEEE
15 years 11 months ago
2006
IEEE
In this paper, we study distributed approximation algorithms for fault-tolerant clustering in wireless ad hoc and sensor networks. A k-fold dominating set of a graph G = (V, E) is...
261
click to vote
ICDE
2009
IEEE
16 years 6 months ago
2009
IEEE
Abstract-- Particle simulation has become an important research tool in many scientific and engineering fields. Data generated by such simulations impose great challenges to databa...