Sciweavers

4066 search results - page 92 / 814
» Almost Complete Sets
Sort
View
APPROX
2010
Springer
179views Algorithms» more  APPROX 2010»
13 years 11 months ago
Rumor Spreading on Random Regular Graphs and Expanders
Broadcasting algorithms are important building blocks of distributed systems. In this work we investigate the typical performance of the classical and well-studied push model. Assu...
Nikolaos Fountoulakis, Konstantinos Panagiotou
TMC
2008
78views more  TMC 2008»
13 years 10 months ago
SELECT: Self-Learning Collision Avoidance for Wireless Networks
The limited number of orthogonal channels and autonomous installations of hotspots and home wireless networks often leave neighboring 802.11 basic service sets (BSSs) operating on ...
Chun-cheng Chen, Eunsoo Seo, Hwangnam Kim, Haiyun ...
SIAMCOMP
2002
124views more  SIAMCOMP 2002»
13 years 9 months ago
The Nonstochastic Multiarmed Bandit Problem
Abstract. In the multiarmed bandit problem, a gambler must decide which arm of K nonidentical slot machines to play in a sequence of trials so as to maximize his reward. This class...
Peter Auer, Nicolò Cesa-Bianchi, Yoav Freun...
JCT
2011
90views more  JCT 2011»
13 years 5 months ago
Small subgraphs in random graphs and the power of multiple choices
The standard paradigm for online power of two choices problems in random graphs is the Achlioptas process. Here we consider the following natural generalization: Starting with G0 a...
Torsten Mütze, Reto Spöhel, Henning Thom...
SIGECOM
2011
ACM
216views ECommerce» more  SIGECOM 2011»
13 years 28 days ago
Strategic sequential voting in multi-issue domains and multiple-election paradoxes
In many settings, a group of agents must come to a joint decision on multiple issues. In practice, this is often done by voting on the issues in sequence. In this paper, we model ...
Lirong Xia, Vincent Conitzer, Jérôme ...