97 search results - page 20 / 20 » Logarithmic Regret Algorithms for Online Convex Optimization |
CPM
2007
Springer
13 years 11 months ago
2007
Springer
We consider the two-dimensional Range Minimum Query problem: for a static (m × n)-matrix of size N = mn which may be preprocessed, answer on-line queries of the form “where is t...
IPSN
2009
Springer
13 years 11 months ago
2009
Springer
We consider a scenario in which there are resources at or near nodes of a network, which are either static (e.g. fire stations, parking spots) or mobile (e.g. police cars). Over ...