3049 search results - page 188 / 610 » On the Convergence of Bound Optimization Algorithms |
165
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
The performance of the automatic repeat request-dynamic decode and forward (ARQ-DDF) cooperation protocol is analyzed in two distinct scenarios. The first scenario is the multiple...
186
click to vote
ANOR
2008
15 years 6 months ago
2008
This paper deals with the job-shop scheduling problem with sequencedependent setup times. We propose a new method to solve the makespan minimization problem to optimality. The met...
158
click to vote
COLT
2004
Springer
15 years 12 months ago
2004
Springer
We give an algorithm for the bandit version of a very general online optimization problem considered by Kalai and Vempala [1], for the case of an adaptive adversary. In this proble...
149
click to vote
STOC
2003
ACM
16 years 6 months ago
2003
ACM
A recent seminal result of R?acke is that for any network there is an oblivious routing algorithm with a polylog competitive ratio with respect to congestion. Unfortunately, R?ack...
175
click to vote
ISAAC
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. We study the problem of maintaining a (1+ )-factor approximation of the diameter of a stream of points under the sliding window model. In one dimension, we give a simple ...