407 search results - page 78 / 82 » The Optimal Online Algorithms for Minimizing Maximum Latenes... |
INFOCOM
2000
IEEE
15 years 1 months ago
2000
IEEE
— An ad-hoc network of wireless static nodes is considered as it arises in a rapidly deployed, sensor based, monitoring system. Information is generated in certain nodes and need...
101
click to vote
TIP
1998
14 years 9 months ago
1998
Abstract—We propose a method for the reconstruction of signals and images observed partially through a linear operator with a large support (e.g., a Fourier transform on a sparse...
107
Voted
INFOCOM
2012
IEEE
12 years 12 months ago
2012
IEEE
Abstract—In this paper, we investigate the problem of controlling node sleep intervals so as to achieve the min-max energy fairness in asynchronous duty-cycling sensor networks. ...
SPAA
2004
ACM
15 years 2 months ago
2004
ACM
Page migration is one of the fundamental subproblems in the framework of data management in networks. It occurs in a distributed network of processors sharing one indivisible memo...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...