3016 search results - page 119 / 604 » The Online Transportation Problem |
118
Voted
SWAT
2004
Springer
15 years 9 months ago
2004
Springer
The standard dynamic programming solution to finding k-medians on a line with n nodes requires O(kn2 ) time. Dynamic programming speedup techniques, e.g., use of the quadrangle i...
147
click to vote
ESA
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. We present a first constant performance guarantee for preemptive stochastic scheduling to minimize the sum of weighted completion times. For scheduling jobs with release ...
157
click to vote
CPAIOR
2008
Springer
15 years 5 months ago
2008
Springer
The one-step anticipatory algorithm (1s-AA) is an online algorithm making decisions under uncertainty by ignoring future non-anticipativity constraints. It makes near-optimal decis...
149
click to vote
AAAI
1998
15 years 5 months ago
1998
In this paper, we describe methods for e ciently computing better solutions to control problems in continuous state spaces. We provide algorithms that exploit online search to boo...
139
Voted
SIAMSC
2010
15 years 2 months ago
2010
Frequently, the computation of derivatives for optimizing time-dependent problems is based on the integration of the adjoint differential equation. For this purpose, the knowledge...