212 search results - page 11 / 43 » Competitive Online Approximation of the Optimal Search Ratio |
ICPR
2008
IEEE
14 years 2 months ago
2008
IEEE
A fast online algorithm was developed for polygonal approximation of signals and curves with a minimum number of line segments for a given constraint on the standard deviation of ...
ACL
2010
13 years 5 months ago
2010
We consider the search for a maximum likelihood assignment of hidden derivations and grammar weights for a probabilistic context-free grammar, the problem approximately solved by ...
ISAAC
1999
Springer
13 years 12 months ago
1999
Springer
We introduce an online relocation problem on a graph, in which a player who walks around the nodes makes decisions on whether to relocate mobile resources, while not knowing the fu...
COCOON
2006
Springer
13 years 11 months ago
2006
Springer
We study the dynamic bin packing problem introduced by Coffman, Garey and Johnson. This problem is a generalization of the bin packing problem in which items may arrive and depart...
JACM
2006
13 years 7 months ago
2006
We consider the generalized on-line two-server problem in which at each step each server receives a request, which is a point in a metric space. One of the servers has to be moved ...