68-XX COMPUTER SCIENCE (For papers involving machine computations and programs in a specific mathematical area, see Section -04 in that area)
Refine
Year of publication
Document Type
- ZIB-Report (44)
- Master's Thesis (5)
- Software (4)
- Article (1)
Language
- English (54) (remove)
Keywords
- Ubiquity Generator Framework (3)
- Computational Diagnosis (2)
- Convex Optimization (2)
- Discrete optimization (2)
- Knee Osteoarthritis (2)
- Lattice problem (2)
- Lattice-based cryptography (2)
- MSM (2)
- Machine Learning (2)
- Parallel algorithms (2)
Institute
- Mathematical Optimization (22)
- Visual and Data-centric Computing (14)
- Visual Data Analysis (11)
- Mathematics of Telecommunication (7)
- Applied Algorithmic Intelligence Methods (6)
- Numerical Mathematics (5)
- Distributed Algorithms and Supercomputing (3)
- Mathematical Optimization Methods (3)
- Computational Molecular Design (2)
- Image Analysis in Biology and Materials Science (2)
This paper proposes a new method for probabilistic analysis of online algorithms. It is based on the notion of stochastic dominance. We develop the method for
the online bin coloring problem introduced by Krumke et al (2008). Using methods for the stochastic
comparison of Markov chains we establish the result that the performance of the online algorithm GreedyFit is stochastically better than the performance of the algorithm OneBin for any number of items processed. This result gives a more realistic
picture than competitive analysis and explains the behavior observed in simulations.