Sciweavers

1224 search results - page 146 / 245
» Theory decision by decomposition
Sort
View
CISS
2008
IEEE
15 years 7 months ago
Network distribution capacity and content-pipe gap
Abstract— The growth of video content and diversification of content-sharing methods in the Internet lead to an exciting range of new problems in networking, communications, and...
Mung Chiang
PODC
2005
ACM
15 years 6 months ago
On the locality of bounded growth
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
107
Voted
ESA
2004
Springer
145views Algorithms» more  ESA 2004»
15 years 6 months ago
Flows on Few Paths: Algorithms and Lower Bounds
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...
Maren Martens, Martin Skutella
93
Voted
SMA
2009
ACM
117views Solid Modeling» more  SMA 2009»
15 years 7 months ago
Discrete physics using metrized chains
Over the last fifty years, there have been numerous efforts to develop from first principles a comprehensive discrete formulation of geometric physics, including Whitney’s ge...
Antonio DiCarlo, Franco Milicchio, Alberto Paoluzz...
110
Voted
INFOCOM
2007
IEEE
15 years 7 months ago
The Impact of Stochastic Noisy Feedback on Distributed Network Utility Maximization
—The implementation of distributed network utility maximization (NUM) algorithms hinges heavily on information feedback through message passing among network elements. In practic...
Junshan Zhang, Dong Zheng, Mung Chiang