2732 search results - page 60 / 547 » Fast and Distributed Computation of Schedules in Wireless Ne... |
146
click to vote
JCO
2006
14 years 9 months ago
2006
We study a novel "coverage by directional sensors" problem with tunable orientations on a set of discrete targets. We propose a Maximum Coverage with Minimum Sensors (MCM...
NCA
2003
IEEE
15 years 3 months ago
2003
IEEE
This paper addresses the problem of how to service web requests quickly in order to minimize the client response time. Some of the recent work uses the idea of the Shortest Remain...
ICALP
2007
Springer
15 years 1 months ago
2007
Springer
Abstract. We study the problem of the amount of information (advice) about a graph that must be given to its nodes in order to achieve fast distributed computations. The required s...
TON
2008
14 years 9 months ago
2008
We consider a multi-hop wireless network shared by many users. For an interference model that constrains a node to either transmit to or receive from only one other node at a time,...
INFOCOM
2005
IEEE
15 years 3 months ago
2005
IEEE
— Recent years have seen tremendous growth in the deployment of Wireless Local Area Networks (WLANs). An important design issue in such networks is that of distributed scheduling...