4962 search results - page 34 / 993 » Connectivity in Sub-Poisson Networks |
113
click to vote
ICASSP
2009
IEEE
15 years 8 months ago
2009
IEEE
We introduce a distributed adaptive estimation algorithm operating in an ideal fully connected sensor network. The algorithm estimates node-specific signals at each node based on...
117
click to vote
WOWMOM
2005
ACM
15 years 7 months ago
2005
ACM
The vast majority of mobile ad hoc networking research makes a very large assumption: that communication can only take place between nodes that are simultaneously accessible withi...
102
click to vote
ICCSA
2005
Springer
15 years 7 months ago
2005
Springer
The major objective of this paper is to deploy an effective evolutionary algorithm (EA) for the congestion problem in connection-oriented networks. The network flow is modeled as n...
107
Voted
SODA
2010
ACM
15 years 11 months ago
2010
ACM
The group Steiner problem is a classical network design problem where we are given a graph and a collection of groups of vertices, and want to build a min-cost subgraph that conne...
111
click to vote
INFOCOM
2008
IEEE
15 years 8 months ago
2008
IEEE
— The relay node placement problem for wireless sensor networks is concerned with placing a minimum number of relay nodes into a wireless sensor network to meet certain connectiv...