116 search results - page 3 / 24 » Solving network design problems via iterative aggregation |
156
click to vote
ICASSP
2011
IEEE
14 years 4 months ago
2011
IEEE
We design two different strategies for computing the unknown content preferences in an online social network based on a small set of nodes in the corresponding social graph for wh...
114
click to vote
CSCLP
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. We adopt Benders’ decomposition algorithm to solve scenariobased Stochastic Constraint Programs (SCPs) with linear recourse. Rather than attempting to solve SCPs via a ...
127
click to vote
ECAI
2008
Springer
15 years 2 months ago
2008
Springer
Time is a crucial variable in planning and often requires special attention since it introduces a specific structure along with additional complexity, especially in the case of dec...
WCNC
2008
IEEE
15 years 7 months ago
2008
IEEE
— In this paper, we address the network maintenance problem, in which we aim to maximize the lifetime of a sensor network by adding a set of relays to it. The network lifetime is...
129
click to vote
INFOCOM
2008
IEEE
15 years 7 months ago
2008
IEEE
Cognitive radio (CR) is a revolution in radio technology and is viewed as an enabling technology for dynamic spectrum access. This paper investigates how to design distributed alg...