Proving Time Bounds for Randomized Distributed Algorithms.
Nancy A. LynchIsaac SaiasRoberto SegalaPublished in: PODC (1994)
Keyphrases
- randomized algorithms
- worst case
- error bounds
- upper and lower bounds
- cooperative
- distributed systems
- optimization problems
- times faster
- computational efficiency
- orders of magnitude
- data sets
- data mining techniques
- lower and upper bounds
- learning algorithm
- pac bayesian
- generalization error bounds
- computationally efficient
- data dependent
- distributed environment
- significant improvement
- data structure
- multi agent
- genetic algorithm
- machine learning