Sciweavers

Share
4930 search results - page 1 / 986
» Online algorithms for network design
Sort
View
SPAA
2004
ACM
9 years 2 months ago
Online algorithms for network design
This paper presents the first polylogarithmic-competitive online algorithms for two-metric network design problems. These problems arise naturally in the design of computer netwo...
Adam Meyerson
STOC
2009
ACM
139views Algorithms» more  STOC 2009»
9 years 9 months ago
Online and stochastic survivable network design
Consider the edge-connectivity survivable network design problem: given a graph G = (V, E) with edge-costs, and edgeconnectivity requirements rij Z0 for every pair of vertices i,...
Anupam Gupta, Ravishankar Krishnaswamy, R. Ravi
INFOCOM
2000
IEEE
9 years 1 months ago
Efficient Handoff Rerouting Algorithms: A Competitive On-Line Algorithmic Approach
—This paper considers the design of handoff rerouting algorithms for reducing the overall session cost in personal communication systems (PCS). Most modern communication systems ...
Yigal Bejerano, Israel Cidon, Joseph Naor
IJON
2006
111views more  IJON 2006»
8 years 9 months ago
Dynamic pruning algorithm for multilayer perceptron based neural control systems
Generalization ability of neural networks is very important and a rule of thumb for good generalization in neural systems is that the smallest system should be used to fit the tra...
Jie Ni, Qing Song
JSAC
2016
67views more  JSAC 2016»
3 years 5 months ago
An Online Gradient Algorithm for Optimal Power Flow on Radial Networks
—We propose an online algorithm for solving optimal power flow (OPF) problems on radial networks where the controllable devices continuously interact with the network that impli...
Lingwen Gan, Steven H. Low
books