We study a generalization of the classical secretary problem which we call the “matroid secretary problem”. In this problem, the elements of a matroid are presented to an onli...
Moshe Babaioff, Nicole Immorlica, Robert Kleinberg
We examine a general Bayesian framework for constructing on-line prediction algorithms in the experts setting. These algorithms predict the bits of an unknown Boolean sequence usin...
Abstract--We design and implement a multicost impairmentaware routing and wavelength assignment algorithm for online traffic. In transparent optical networks the quality of a trans...
With today's demands for continuous availability of mission-critical databases, on-line reorganization is a necessity. In this paper we present a new on-Iine reorganization a...
A class of time-varying discrete-event systems, named dynamic discrete-event systems, is defined. The goal of this paper is to provide a method which is modular and can be applied ...