Universal-stability results and performance bounds for greedy contention-resolution protocols.
Matthew AndrewsBaruch AwerbuchAntonio FernándezFrank Thomson LeightonZhiyong LiuJon M. KleinbergPublished in: J. ACM (2001)
Keyphrases
- greedy algorithm
- upper bound
- worst case
- lower bound
- high resolution
- search algorithm
- consequence finding
- upper and lower bounds
- error bounds
- lipschitz continuity
- variance reduction
- empirical risk minimization
- lower and upper bounds
- greedy heuristic
- locally optimal
- dynamic programming
- greedy strategy
- worst case bounds
- uniform convergence
- cryptographic protocols
- generalization bounds
- stability analysis
- average case
- low resolution