Sciweavers

1518 search results - page 32 / 304
» Exact and Approximate Bandwidth
Sort
View
INFOCOM
2009
IEEE
14 years 4 months ago
Network Bandwidth Allocation via Distributed Auctions with Time Reservations
—This paper studies the problem of allocating network capacity through periodic auctions. Motivated primarily by a service overlay architecture, we impose the following condition...
Pablo Belzarena, Andrés Ferragut, Fernando ...
INFOCOM
2005
IEEE
14 years 3 months ago
Differentiated bandwidth sharing with disparate flow sizes
Abstract— We consider a multi-class queueing system operating under the Discriminatory Processor-Sharing (DPS) discipline. The DPS discipline provides a natural approach for mode...
Gijs van Kessel, R. Núñez Queija, Se...
SIGECOM
2011
ACM
203views ECommerce» more  SIGECOM 2011»
13 years 16 days ago
Polynomial-time computation of exact correlated equilibrium in compact games
In a landmark paper, Papadimitriou and Roughgarden [2008] described a polynomial-time algorithm (“Ellipsoid Against Hope”) for computing sample correlated equilibria of concis...
Albert Xin Jiang, Kevin Leyton-Brown
SDM
2009
SIAM
164views Data Mining» more  SDM 2009»
14 years 7 months ago
Exact Discovery of Time Series Motifs.
Time series motifs are pairs of individual time series, or subsequences of a longer time series, which are very similar to each other. As with their discrete analogues in computat...
Abdullah Mueen, Eamonn J. Keogh, M. Brandon Westov...
CORR
2008
Springer
139views Education» more  CORR 2008»
13 years 9 months ago
Exact two-terminal reliability of some directed networks
Abstract-- The calculation of network reliability in a probabilistic context has long been an issue of practical and academic importance. Conventional approaches (determination of ...
Christian Tanguy