3875 search results - page 243 / 775 » Approximation algorithms for the 0-extension problem |
175
click to vote
ATAL
2007
Springer
16 years 26 days ago
2007
Springer
Reinforcement learning promises a generic method for adapting agents to arbitrary tasks in arbitrary stochastic environments, but applying it to new real-world problems remains di...
140
click to vote
PROCEDIA
2010
15 years 5 months ago
2010
High-quality meshes are essential in the solution of partial differential equations (PDEs), which arise in numerous science and engineering applications, as the mesh quality aff...
164
click to vote
IPCO
1998
15 years 8 months ago
1998
We provide several non-approximability results for deterministic scheduling problems whose objective is to minimize the total job completion time. Unless P = NP, none of the probl...
199
click to vote
ANOR
2007
15 years 6 months ago
2007
The quality of multi-stage stochastic optimization models as they appear in asset liability management, energy planning, transportation, supply chain management, and other applicat...
175
click to vote
ANOR
2010
15 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...