Sciweavers

8540 search results - page 224 / 1708
» The Dynamic Servers Problem
Sort
View
211
Voted
CP
2009
Springer
16 years 4 months ago
Search Spaces for Min-Perturbation Repair
Many problems require minimally perturbing an initial state in order to repair some violated constraints. We consider two search spaces for exactly solving this minimal perturbatio...
Alex S. Fukunaga
152
Voted
MMB
2010
Springer
194views Communications» more  MMB 2010»
15 years 8 months ago
Searching for Tight Performance Bounds in Feed-Forward Networks
Abstract. Computing tight performance bounds in feed-forward networks under general assumptions about arrival and server models has turned out to be a challenging problem. Recently...
Andreas Kiefer, Nicos Gollan, Jens B. Schmitt
131
Voted
AUTOMATICA
2004
104views more  AUTOMATICA 2004»
15 years 3 months ago
Dynamics and stability in optical communication networks: a system theory framework
This paper addresses the problem of dynamics analysis in optical networks from a system control perspective. A general framework for
Lacra Pavel
97
Voted
CDC
2008
IEEE
120views Control Systems» more  CDC 2008»
15 years 10 months ago
On time-scale designs for networks
—We motivate the problem of designing a subset of the edge weights in a graph, to shape the spectrum of an associated linear time-invariant dynamics. We address a canonical desig...
Sandip Roy, Yan Wan, Ali Saberi
TON
2002
91views more  TON 2002»
15 years 3 months ago
The stable paths problem and interdomain routing
Abstract-Dynamic routing protocols such as RIP and OSPF essentially implement distributed algorithms for solving the Shortest Paths Problem. The Border Gateway Protocol (BGP) is cu...
Timothy Griffin, F. Bruce Shepherd, Gordon T. Wilf...