Sciweavers

914 search results - page 41 / 183
» Branch and Bound on the Network Model
Sort
View
SIGCOMM
2010
ACM
14 years 10 months ago
Cloudward bound: planning for beneficial migration of enterprise applications to the cloud
In this paper, we tackle challenges in migrating enterprise services into hybrid cloud-based deployments, where enterprise operations are partly hosted on-premise and partly in th...
Mohammad Y. Hajjat, Xin Sun, Yu-Wei Eric Sung, Dav...
SIAMCOMP
2000
104views more  SIAMCOMP 2000»
14 years 9 months ago
A Near-Tight Lower Bound on the Time Complexity of Distributed Minimum-Weight Spanning Tree Construction
This paper presents a lower bound of (D + n/ log n) on the time required for the distributed construction of a minimum-weight spanning tree (MST) in weighted n-vertex networks of ...
David Peleg, Vitaly Rubinovich
WCNC
2008
IEEE
15 years 4 months ago
Distributed Energy Efficient Spectrum Access in Wireless Cognitive Radio Sensor Networks
—In this paper, a wireless cognitive radio sensor network is considered, where each sensor node is equipped with cognitive radio and the network is a multi-carrier system operati...
Song Gao, Lijun Qian, Dhadesugoor R. Vaman
NETWORKS
2010
14 years 8 months ago
A mean-variance model for the minimum cost flow problem with stochastic arc costs
This paper considers a minimum cost flow problem where arc costs are uncertain, and the decision maker wishes to minimize both the expected flow cost and the variance of this co...
Stephen D. Boyles, S. Travis Waller
ESOP
2001
Springer
15 years 2 months ago
On the Complexity of Constant Propagation
Constant propagation (CP) is one of the most widely used optimizations in practice (cf. [9]). Intuitively, it addresses the problem of statically detecting whether an expression al...
Markus Müller-Olm, Oliver Rüthing