4781 search results - page 145 / 957 » Online algorithms for network design |
164
click to vote
WDAG
2009
Springer
16 years 1 months ago
2009
Springer
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 ...
167
click to vote
INFOCOM
2010
IEEE
15 years 5 months ago
2010
IEEE
—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 ...
149
click to vote
WEA
2007
Springer
16 years 19 days ago
2007
Springer
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...
166
click to vote
INFOCOM
2007
IEEE
16 years 25 days ago
2007
IEEE
— 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...
162
click to vote
CEC
2003
IEEE
15 years 12 months ago
2003
IEEE
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...