Sciweavers

106 search results - page 4 / 22
» A randomized on-line algorithm for the k-server problem on a...
Sort
View
FOCS
1993
IEEE
13 years 11 months ago
An On-Line Algorithm for Improving Performance in Navigation
We consider the following scenario. A point robot is placed at some start location ¡ in a 2dimensional scene containing oriented rectangular obstacles. The robot must repeatedly ...
Avrim Blum, Prasad Chalasani
ALGORITHMICA
1999
156views more  ALGORITHMICA 1999»
13 years 7 months ago
Competitive Optimal On-Line Leasing
Consider an on-line player who needs some equipment (e.g., a computer) for an initially unknown number of periods. At the start of each period it is determined whether the player w...
Ran El-Yaniv, R. Kaniel, Nathan Linial
ALGORITHMICA
1998
103views more  ALGORITHMICA 1998»
13 years 7 months ago
On Bayes Methods for On-Line Boolean Prediction
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...
Nicolò Cesa-Bianchi, David P. Helmbold, San...
COCOON
2001
Springer
13 years 12 months ago
On-Line Variable Sized Covering
We consider one-dimensional and multi-dimensional vector covering with variable sized bins. In the one-dimensional case, we consider variable sized bin covering with bounded item ...
Leah Epstein
ICALP
2011
Springer
12 years 11 months ago
On the Advice Complexity of the k-Server Problem
Competitive analysis is the established tool for measuring the output quality of algorithms that work in an online environment. Recently, the model of advice complexity has been in...
Hans-Joachim Böckenhauer, Dennis Komm, Rastis...