212 search results - page 11 / 43 » Competitive Online Approximation of the Optimal Search Ratio |
159
click to vote
ICPR
2008
IEEE
16 years 12 days 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 ...
140
click to vote
ACL
2010
15 years 4 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 ...
135
click to vote
ISAAC
1999
Springer
15 years 10 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...
180
click to vote
COCOON
2006
Springer
15 years 9 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...
157
click to vote
JACM
2006
15 years 6 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 ...