Year: 1990
Type: conference-paper
Abstract: We study the design and analysis of randomized on-line algorithms.We show that this problem is closely related to the synthesis of random walks on graphs with positive real costs on their edges.
Authors: D. Coppersmith, P. Doyle, P. Raghavan, M. Snir
Language: English
Subfield: Theoretical Computer Science
Field: Mathematics
Domain: Physical Sciences
Open Access status: bronze
OpenAlex ID: W2007997471
