Sciweavers

139 search results - page 9 / 28
» AdWords and generalized online matching
Sort
View
CCR
2008
91views more  CCR 2008»
14 years 9 months ago
Serial experiments online
Current network protocols must comply with rigid interfaces and rules of behavior to fit into well defined, vertical protocol stacks. It is difficult for network designers to offe...
Juan J. Ramos-Muñoz, Lidia Yamamoto, Christ...
ALGORITHMICA
2010
143views more  ALGORITHMICA 2010»
14 years 9 months ago
Absolute and Asymptotic Bounds for Online Frequency Allocation in Cellular Networks
Given a cellular (mobile telephone) network, whose geographical coverage area is divided into hexagonal cells, phone calls are serviced by assigning frequencies to them so that no...
Joseph Wun-Tat Chan, Francis Y. L. Chin, Deshi Ye,...
GROUP
2010
ACM
14 years 7 months ago
Everyday favors: a case study of a local online gift exchange system
This paper focuses on online gift exchange in a setting where online and offline interactions are tightly intertwined and most of the exchanges require face-to-face interaction to...
Emmi Suhonen, Airi Lampinen, Coye Cheshire, Judd A...
ESA
2007
Springer
125views Algorithms» more  ESA 2007»
15 years 3 months ago
Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue
We study the online ad-auctions problem introduced by Mehta et. al. [15]. We design a (1 − 1/e)competitive (optimal) algorithm for the problem, which is based on a clean primal-...
Niv Buchbinder, Kamal Jain, Joseph Naor
CSR
2009
Springer
15 years 4 months ago
Variations on Muchnik's Conditional Complexity Theorem
Muchnik’s theorem about simple conditional descriptions states that for all strings a and b there exists a short program p transforming a to b that has the least possible length ...
Daniil Musatov, Andrei E. Romashchenko, Alexander ...