5889 search results - page 953 / 1178 » Graph Layout Problems |
173
click to vote
IPSN
2005
Springer
16 years 17 hour ago
2005
Springer
We consider coverage problems in sensor networks of stationary nodes with minimal geometric data. In particular, there are no coordinates and no localization of nodes. We introduc...
169
click to vote
IWQOS
2005
Springer
16 years 12 hour ago
2005
Springer
Abstract. Previous work have assumed an independent model for overlay networks: a graph with independent link capacities. We introduce a model of overlays (LCC-overlay) which incor...
144
click to vote
PAM
2005
Springer
16 years 5 hour ago
2005
Springer
Abstract. The development of veracious models of the Internet topology has received a lot of attention in the last few years. Many proposed models are based on topologies derived f...
170
click to vote
AUSAI
2005
Springer
15 years 12 months ago
2005
Springer
The key problem in applying verification techniques such as model checking to agent architectures is to show how to map systematically from an agent program to a model structure t...
163
click to vote
DMSN
2004
ACM
15 years 12 months ago
2004
ACM
We consider the in-network computation of approximate “big picture” summaries in bandwidth-constrained sensor networks. First we review early work on computing the Haar wavele...