Sciweavers

1059 search results - page 121 / 212
» Improved Algorithms via Approximations of Probability Distri...
Sort
View
MOBIHOC
2012
ACM
13 years 8 days ago
Spatial spectrum access game: nash equilibria and distributed learning
A key feature of wireless communications is the spatial reuse. However, the spatial aspect is not yet well understood for the purpose of designing efficient spectrum sharing mecha...
Xu Chen, Jianwei Huang
CIKM
2004
Springer
15 years 3 months ago
Local methods for estimating pagerank values
The Google search engine uses a method called PageRank, together with term-based and other ranking techniques, to order search results returned to the user. PageRank uses link ana...
Yen-Yu Chen, Qingqing Gan, Torsten Suel
INFOCOM
2000
IEEE
15 years 2 months ago
Quantifying the Benefit of Configurability in Circuit-Switched WDM Ring Networks
—In a reconfigurable network, lightpath connections can be dynamically changed to reflect changes in traffic conditions. This paper characterizes the gain in traffic capacity tha...
Brett Schein, Eytan Modiano
COCO
2009
Springer
155views Algorithms» more  COCO 2009»
15 years 4 months ago
Weak Derandomization of Weak Algorithms: Explicit Versions of Yao's Lemma
—A simple averaging argument shows that given a randomized algorithm A and a function f such that for every input x, Pr[A(x) = f(x)] ≥ 1−ρ (where the probability is over the...
Ronen Shaltiel
ATAL
2010
Springer
14 years 10 months ago
PAC-MDP learning with knowledge-based admissible models
PAC-MDP algorithms approach the exploration-exploitation problem of reinforcement learning agents in an effective way which guarantees that with high probability, the algorithm pe...
Marek Grzes, Daniel Kudenko