Sciweavers

1639 search results - page 328 / 328
» Degree-constrained network flows
Sort
View
MP
2002
85views more  MP 2002»
13 years 5 months ago
From fluid relaxations to practical algorithms for job shop scheduling: the makespan objective
We design an algorithm, called the fluid synchronization algorithm (FSA), for the job shop scheduling problem with the objective of minimizing the makespan. We round an optimal sol...
Dimitris Bertsimas, Jay Sethuraman
TON
2002
76views more  TON 2002»
13 years 4 months ago
Some properties of variable length packet shapers
The min-plus theory of greedy shapers has been developed after Cruz's results on the calculus of network delays. An example of greedy shaper is the buffered leaky bucket cont...
Jean-Yves Le Boudec
PAMI
2010
222views more  PAMI 2010»
13 years 3 months ago
Minimal Surfaces Extend Shortest Path Segmentation Methods to 3D
—Shortest paths have been used to segment object boundaries with both continuous and discrete image models. Although these techniques are well defined in 2D, the character of the...
Leo Grady
IMC
2010
ACM
13 years 3 months ago
Improving content delivery using provider-aided distance information
Content delivery systems constitute a major portion of today's Internet traffic. While they are a good source of revenue for Internet Service Providers (ISPs), the huge volum...
Ingmar Poese, Benjamin Frank, Bernhard Ager, Georg...