Sciweavers

2714 search results - page 479 / 543
» Approximation Schemes for Scheduling
Sort
View
93
Voted
SIGMETRICS
2000
ACM
15 years 5 months ago
TCP in presence of bursty losses
In this paper we analyze the performance of a TCP-like flow control in a lossy environment. The transmission rate in the control scheme that we consider has a linear growth rate;...
Eitan Altman, Konstantin Avrachenkov, Chadi Baraka...
93
Voted
STOC
1999
ACM
132views Algorithms» more  STOC 1999»
15 years 4 months ago
A Polynomial Combinatorial Algorithm for Generalized Minimum Cost Flow
We propose the first combinatorial solution to one of the most classic problems in combinatorial optimization: the generalized minimum cost flow problem (flow with losses and g...
Kevin D. Wayne
INFOCOM
1999
IEEE
15 years 4 months ago
Inference of Multicast Routing Trees and Bottleneck Bandwidths Using End-to-end Measurements
Abstract-- The efficacy of end-to-end multicast transport protocols depends critically upon their ability to scale efficiently to a large number of receivers. Several research mult...
Sylvia Ratnasamy, Steven McCanne
NGITS
1999
Springer
15 years 4 months ago
Multiplex: A Formal Model for Multidatabases and Its Implementation
The integration of information from multiple databases has been an enduring subject of research for over 20 years, and many different solutions have been attempted or proposed. Mis...
Amihai Motro
86
Voted
COCO
1998
Springer
98views Algorithms» more  COCO 1998»
15 years 4 months ago
Probabilistic Martingales and BPTIME Classes
We define probabilistic martingales based on randomized approximation schemes, and show that the resulting notion of probabilistic measure has several desirable robustness propert...
Kenneth W. Regan, D. Sivakumar