Sciweavers

Share
SCHEDULING
2011
8 years 9 months ago
On robust online scheduling algorithms
While standard parallel machine scheduling is concerned with good assignments of jobs to machines, we aim to understand how the quality of an assignment is affected if the jobs...
Michael Gatto, Peter Widmayer
CORR
2011
Springer
210views Education» more  CORR 2011»
8 years 9 months ago
Competitive and Deterministic Embeddings of Virtual Networks
Network virtualization is a paradigm that allows for flexible and efficient allocation of the resources among multiple virtual networks (VNets). In this paper we deal with the p...
Guy Even, Moti Medina, Gregor Schaffrath, Stefan S...
DMTCS
2010
146views Mathematics» more  DMTCS 2010»
8 years 11 months ago
Tight Bounds for Delay-Sensitive Aggregation
This paper studies the fundamental trade-off between communication cost and delay cost arising in various contexts such as control message aggregation or organization theory. An o...
Yvonne Anne Pignolet, Stefan Schmid, Roger Wattenh...
WINE
2010
Springer
168views Economy» more  WINE 2010»
9 years 2 days 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
MST
2002
107views more  MST 2002»
9 years 1 months ago
Efficient On-Line Frequency Allocation and Call Control in Cellular Networks
Abstract. In this paper we consider communication issues arising in cellular (mobile) networks that utilize frequency division multiplexing (FDM) technology. In such networks, many...
Ioannis Caragiannis, Christos Kaklamanis, Evi Papa...
SIAMCOMP
2000
161views more  SIAMCOMP 2000»
9 years 2 months ago
Application-Controlled Paging for a Shared Cache
We propose a provably efficient application-controlled global strategy for organizing a cache of size k shared among P application processes. Each application has access to informa...
Rakesh D. Barve, Edward F. Grove, Jeffrey Scott Vi...
CORR
2004
Springer
118views Education» more  CORR 2004»
9 years 2 months ago
Online Companion Caching
This paper is concerned with online caching algorithms for the (n, k)-companion cache, defined by Brehob et. al. [3]. In this model the cache is composed of two components: a k-way...
Manor Mendel, Steven S. Seiden
JCSS
2007
89views more  JCSS 2007»
9 years 2 months ago
The relative worst-order ratio applied to paging
The relative worst order ratio, a new measure for the quality of on-line algorithms, was recently defined and applied to two bin packing problems. Here, we extend the definition ...
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen
JCO
2007
100views more  JCO 2007»
9 years 2 months ago
Semi-online scheduling with "end of sequence" information
We study a variant of classical scheduling, which is called scheduling with “end of sequence” information. It is known in advance that the last job has the longest processing ...
Leah Epstein, Deshi Ye
JACM
2006
134views more  JACM 2006»
9 years 2 months ago
Online algorithms for market clearing
In this article, we study the problem of online market clearing where there is one commodity in the market being bought and sold by multiple buyers and sellers whose bids arrive an...
Avrim Blum, Tuomas Sandholm, Martin Zinkevich
books