3638 search results - page 395 / 728 » Optimization via communication networks |
206
click to vote
IPSN
2004
Springer
16 years 3 days ago
2004
Springer
In this paper we develop algorithms for distributed computation of a broad range of estimation and detection tasks over networks with arbitrary but fixed connectivity. The distri...
241
click to vote
ICOIN
2003
Springer
15 years 12 months ago
2003
Springer
Abstract. In this paper, we define the routing overhead as the amount of information needed to describe the changes in a network topology. We derive a universal lower bound on the...
177
click to vote
ICPP
1999
IEEE
15 years 11 months ago
1999
IEEE
In this paper, we present the index-permutation (IP) graph model, and apply it to the systematic development of efficient hierarchical networks. We derive several classes of inter...
155
click to vote
CONEXT
2005
ACM
15 years 8 months ago
2005
ACM
Energy efficiency is a critical issue in designing sensor networks, as the nodes have limited battery power. In this paper we propose to move the BS so as to prolong the network l...
162
click to vote
NOCS
2007
IEEE
16 years 1 months ago
2007
IEEE
Dynamic routing can substantially enhance the quality of service for multiprocessor communication, and can provide intelligent adaptation of faulty links during run time. Implemen...