Sciweavers

160 search results - page 6 / 32
» A General Buffer Scheme for the Windows Scheduling Problem
Sort
View
4OR
2004
99views more  4OR 2004»
14 years 11 months ago
Upper bounds for revenue maximization in a satellite scheduling problem
This paper presents upper bounds for the Satellite Revenue Selection and Scheduling problem (SRSS). A compact model of this generalized Prize Collecting Traveling Salesman Problem ...
Thierry Benoist, Benoît Rottembourg
AUTOMATICA
2008
89views more  AUTOMATICA 2008»
14 years 12 months ago
Dynamic buffer management using optimal control of hybrid systems
This paper studies a general dynamic buffer management problem with one buffer inserted between two interacting components. The component to be controlled is assumed to have multi...
Wei Zhang, Jianghai Hu
ANCS
2007
ACM
15 years 3 months ago
Congestion management for non-blocking clos networks
We propose a distributed congestion management scheme for non-blocking, 3-stage Clos networks, comprising plain buffered crossbar switches. VOQ requests are routed using multipath...
Nikolaos Chrysos
SODA
1997
ACM
111views Algorithms» more  SODA 1997»
15 years 1 months ago
Approximation Schemes for Scheduling
We discuss scheduling problems with m identical machines and n jobs where each job has to be assigned to some machine. The goal is to optimize objective functions that solely depe...
Noga Alon, Yossi Azar, Gerhard J. Woeginger, Tal Y...
ICC
2008
IEEE
111views Communications» more  ICC 2008»
15 years 6 months ago
Conservative Slow Start: Controlling Losses in Very High Speed Networks
—In this paper, we address the problem of how TCP sessions ramp up their transmission windows in a controlled way. We introduce a conservative slow start scheme that reduces to t...
Kazumi Kumazoe, Cesar Marcondes, Mario Gerla, Dirc...