212 search results - page 13 / 43 » Competitive Online Approximation of the Optimal Search Ratio |
COMPGEOM
1994
ACM
13 years 11 months ago
1994
ACM
We consider the problem of a robot which has to find a target in an unknown simple polygon, based only on what it has seen so far. A street is a polygon for which the two boundary...
WIOPT
2005
IEEE
14 years 1 months ago
2005
IEEE
In this paper we consider the problem of searching for a node or an object (i.e., piece of data, file, etc.) in a large wireless network. We consider the class of controlled flo...
STACS
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We study the management of buffers and storages in environments with unpredictably varying prices in a competitive analysis. In the economical caching problem, there is ...
JCSS
2006
13 years 7 months ago
2006
A nearly logarithmic lower bound on the randomized competitive ratio for the metrical task systems problem is presented. This implies a similar lower bound for the extensively stu...
ISAAC
2009
Springer
14 years 2 months ago
2009
Springer
The problem of maintaining geometric structures for points in motion has been well studied over the years. Much theoretical work to date has been based on the assumption that point...