34 search results - page 3 / 7 » Stochastic Online Scheduling Revisited |
ASIAN
2004
Springer
14 years 25 days ago
2004
Springer
This paper considers online stochastic optimization problems where uncertainties are characterized by a distribution that can be sampled and where time constraints severely limit t...
WSC
2004
13 years 8 months ago
2004
The paper introduces a new model for shipment date quoting with potential applications in E-commerce. First, a customer sends to the vendor a request for an item advertised at a c...
ANOR
2010
13 years 5 months ago
2010
This paper considers online stochastic optimization problems where uncertainties are characterized by a distribution that can be sampled and where time constraints severely limit t...
CPAIOR
2008
Springer
13 years 9 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...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
In reinforcement learning, an agent interacting with its environment strives to learn a policy that specifies, for each state it may encounter, what action to take. Evolutionary c...