Sciweavers

38 search results - page 2 / 8
» Randomized Competitive Analysis for Two-Server Problems
Sort
View
SODA
1998
ACM
104views Algorithms» more  SODA 1998»
13 years 6 months ago
On-line Randomized Call Control Revisited
We consider the problem of on-line call admission and routing on trees and meshes. Previous work gave randomized on-line algorithms for these problems and proved that they have opt...
Stefano Leonardi, Alberto Marchetti-Spaccamela, Al...
WINE
2010
Springer
168views Economy» more  WINE 2010»
13 years 3 months ago
On the Competitive Ratio of Online Sampling Auctions
We study online profit-maximizing auctions for digital goods with adversarial bid selection and uniformly random arrivals. Our goal is to design auctions that are constant competit...
Elias Koutsoupias, George Pierrakos
CCCG
2008
13 years 6 months ago
Competitive Search for Longest Empty Intervals
A problem arising in statistical data analysis and pattern recognition is to find a longest interval free of data points, given a set of data points in the unit interval. We use t...
Peter Damaschke
ICPADS
2006
IEEE
13 years 11 months ago
Joint Optimization of MAC and Network Coding for Cooperative and Competitive Wireless Multicasting
In this paper, we address the problem of cross-layer optimization in medium access control (MAC) and network layers for wireless multicasting with multiple cooperative or competit...
Yalin Evren Sagduyu, Anthony Ephremides
ICALP
2009
Springer
14 years 5 months ago
Algorithms for Secretary Problems on Graphs and Hypergraphs
We examine several online matching problems, with applications to Internet advertising reservation systems. Consider an edge-weighted bipartite graph G, with partite sets L, R. We...
Martin Pál, Nitish Korula