3016 search results - page 101 / 604 » The Online Transportation Problem |
133
click to vote
AIPS
2009
15 years 4 months ago
2009
We propose an online algorithm for planning under uncertainty in multi-agent settings modeled as DEC-POMDPs. The algorithm helps overcome the high computational complexity of solv...
141
click to vote
COCOA
2008
Springer
15 years 5 months ago
2008
Springer
We consider the problem of minimizing the total weighted completion time on identical parallel machines when jobs have stochastic processing times and may arrive over time. We give...
124
click to vote
JCO
2010
14 years 10 months ago
2010
We study a class of scheduling problems with batch setups for the online-list and online-time paradigms. Jobs are to be scheduled in batches for processing. All jobs in a batch st...
226
Voted
ICDE
2009
IEEE
16 years 5 months ago
2009
IEEE
Materializing results from complex aggregation queries helps to significantly improve response times in OLAP servers. This problem is known as the view selection problem: choosing ...
126
click to vote
SWAT
2010
Springer
15 years 8 months ago
2010
Springer
We attend to the classic setting where an observer needs to inform a tracker about an arbitrary time varying function f : N0 → Z. This is an optimization problem, where both wron...