Sciweavers

4781 search results - page 145 / 957
» Online algorithms for network design
Sort
View
180
Voted
WDAG
2009
Springer
166views Algorithms» more  WDAG 2009»
16 years 1 months ago
New Bounds for the Controller Problem
The (M, W)-controller, originally studied by Afek, Awerbuch, Plotkin, and Saks, is a basic ted tool that provides an abstraction for managing the consumption of a global resource ...
Yuval Emek, Amos Korman
INFOCOM
2010
IEEE
15 years 5 months ago
A Systematic Approach for Evolving VLAN Designs
—Enterprise networks are large and complex, and their designs must be frequently altered to adapt to changing organizational needs. The process of redesigning and reconfiguring ...
Xin Sun, Yu-Wei Eric Sung, Sunil Krothapalli, Sanj...
WEA
2007
Springer
95views Algorithms» more  WEA 2007»
16 years 1 months ago
Experimental Evaluation of Parametric Max-Flow Algorithms
The parametric maximum flow problem is an extension of the classical maximum flow problem in which the capacities of certain arcs are not fixed but are functions of a single par...
Maxim A. Babenko, Jonathan Derryberry, Andrew V. G...
179
Voted
INFOCOM
2007
IEEE
16 years 1 months ago
Performance Evaluation of Loss Networks via Factor Graphs and the Sum-Product Algorithm
— Loss networks provide a powerful tool for the analysis and design of many communication and networking systems. It is well known that a large number of loss networks have produ...
Jian Ni, Sekhar Tatikonda
179
Voted
CEC
2003
IEEE
16 years 8 days ago
Comparing neural networks and Kriging for fitness approximation in evolutionary optimization
Neural networks and the Kriging method are compared for constructing £tness approximation models in evolutionary optimization algorithms. The two models are applied in an identica...
Lars Willmes, Thomas Bäck, Yaochu Jin, Bernha...