Sciweavers

3319 search results - page 156 / 664
» The topology of dark networks
Sort
View
TIT
2010
141views Education» more  TIT 2010»
14 years 8 months ago
Distributed averaging via lifted Markov chains
Abstract--Motivated by applications of distributed linear estimation, distributed control, and distributed optimization, we consider the question of designing linear iterative algo...
Kyomin Jung, Devavrat Shah, Jinwoo Shin
ECAI
2008
Springer
15 years 3 months ago
A New Approach to Planning in Networks
Control of networks like those for transportation, power distribution, communication to name a few, provides challenges to planning and scheduling. Many problems can be defined in ...
Jussi Rintanen
EVOW
2009
Springer
15 years 8 months ago
Iterated Local Search for Minimum Power Symmetric Connectivity in Wireless Networks
The problem of finding a symmetric connectivity topology with minimum power consumption in a wireless ad-hoc network is NPhard. This work presents a new iterated local search to s...
Steffen Wolf, Peter Merz
BROADNETS
2005
IEEE
15 years 7 months ago
Uniform vs. non-uniform band switching in WDM networks
— We compare the effectiveness of uniform versus non-uniform waveband switching under the dual cost metrics of switching requirements and fiber capacity. We consider a star topo...
Li-Wei Chen, Poompat Saengudomlert, Eytan Modiano
TC
1998
15 years 1 months ago
Optimal Elections in Faulty Loop Networks and Applications
—Loop networks (or Hamiltonian circulant graphs) are a popular class of fault-tolerant network topologies which include rings and complete graphs. For this class, the fundamental...
Bernard Mans, Nicola Santoro