Sciweavers

1578 search results - page 140 / 316
» Algorithmic randomness of continuous functions
Sort
View
JSAC
2008
139views more  JSAC 2008»
13 years 10 months ago
A Game-Theoretic Framework for Medium Access Control
In this paper, we generalize the random access game model, and show that it provides a general game-theoretic framework for designing contention based medium access control. We ext...
Tao Cui, Lijun Chen, Steven H. Low
ICML
2000
IEEE
14 years 11 months ago
A Nonparametric Approach to Noisy and Costly Optimization
This paper describes Pairwise Bisection: a nonparametric approach to optimizing a noisy function with few function evaluations. The algorithm uses nonparametric reasoning about si...
Brigham S. Anderson, Andrew W. Moore, David Cohn
ECCC
2011
207views ECommerce» more  ECCC 2011»
13 years 5 months ago
Balls and Bins: Smaller Hash Families and Faster Evaluation
A fundamental fact in the analysis of randomized algorithm is that when n balls are hashed into n bins independently and uniformly at random, with high probability each bin contai...
L. Elisa Celis, Omer Reingold, Gil Segev, Udi Wied...
INFOCOM
2008
IEEE
14 years 4 months ago
Association Control in Mobile Wireless Networks
—As mobile nodes roam in a wireless network, they continuously associate with different access points and perform handoff operations. However, these handoffs can potentially incu...
Minkyong Kim, Zhen Liu, Srinivasan Parthasarathy 0...
VALUETOOLS
2006
ACM
176views Hardware» more  VALUETOOLS 2006»
14 years 4 months ago
How to solve large scale deterministic games with mean payoff by policy iteration
Min-max functions are dynamic programming operators of zero-sum deterministic games with finite state and action spaces. The problem of computing the linear growth rate of the or...
Vishesh Dhingra, Stephane Gaubert