3016 search results - page 234 / 604 » The Online Transportation Problem |
207
click to vote
COLT
2005
Springer
15 years 9 months ago
2005
Springer
External regret compares the performance of an online algorithm, selecting among N actions, to the performance of the best of those actions in hindsight. Internal regret compares ...
186
click to vote
CDC
2010
IEEE
15 years 2 months ago
2010
IEEE
Abstract-- An online approach to parameter estimation problems based on binary observations is presented in this paper. This recursive identification method relies on a least-mean ...
169
click to vote
SDM
2007
SIAM
15 years 8 months ago
2007
SIAM
We propose the use of random projections with a sparse matrix to maintain a sketch of a collection of high-dimensional data-streams that are updated asynchronously. This sketch al...
176
click to vote
TSP
2010
15 years 1 months ago
2010
The problem of identification of quasi-periodically varying dynamic systems is considered. This problem can be solved using generalized adaptive notch filtering (GANF) algorithms. ...
302
click to vote
GIS
2007
ACM
16 years 8 months ago
2007
ACM
Given a transportation network, a vulnerable population, and a set of destinations, evacuation route planning identifies routes to minimize the time to evacuate the vulnerable pop...