66 search results - page 3 / 14 » Network design with weighted degree constraints |
ICASSP
2010
IEEE
13 years 6 months ago
2010
IEEE
We consider the weight design problem for the consensus algorithm under a finite time horizon. We assume that the underlying network is random where the links fail at each iterat...
AAAI
2006
13 years 7 months ago
2006
Many planning and design problems can be characterized as optimal search over a constrained network of conditional choices with preferences. To draw upon the advanced methods of c...
STOC
2007
ACM
14 years 6 months ago
2007
ACM
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
ICASSP
2009
IEEE
14 years 1 months ago
2009
IEEE
This paper focuses on perturbation-based distributed beamforming with 1-bit feedback for wireless amplify-and-forward relay networks. We propose to use multiplicative perturbation...
INFOCOM
1998
IEEE
13 years 10 months ago
1998
IEEE
We consider the problem of constructing logical topologies over a wavelength-routed optical network with no wavelength changers. We present a general linear formulation which consi...