3049 search results - page 70 / 610 » On the Convergence of Bound Optimization Algorithms |
117
click to vote
COLT
2008
Springer
15 years 6 months ago
2008
Springer
We present a modification of the algorithm of Dani et al. [8] for the online linear optimization problem in the bandit setting, which with high probability has regret at most O ( ...
226
click to vote
ICDT
2009
ACM
16 years 5 months ago
2009
ACM
Partitioning is an important step in several database algorithms, including sorting, aggregation, and joins. Partitioning is also fundamental for dividing work into equal-sized (o...
135
click to vote
SPAA
2009
ACM
16 years 4 months ago
2009
ACM
In a max-min LP, the objective is to maximise subject to Ax 1, Cx 1, and x 0 for nonnegative matrices A and C. We present a local algorithm (constant-time distributed algorith...
152
click to vote
INFOCOM
2000
IEEE
15 years 8 months ago
2000
IEEE
Abstract—The problem of route address lookup has received much attention recently and several algorithms and data structures for performing address lookups at high speeds have be...
147
click to vote
WEA
2010
Springer
15 years 11 months ago
2010
Springer
This paper is devoted to a study of the impact of using bound sets in biobjective optimization. This notion, introduced by Villareal and Karwan [19], has been independently revisit...